Base | Representation |
---|---|
bin | 100001100000111011011… |
… | …101101111001110010001 |
3 | 22011011201000012101121120 |
4 | 201200323131233032101 |
5 | 300213222112401001 |
6 | 4522010220312453 |
7 | 325251653014110 |
oct | 41407335571621 |
9 | 8134630171546 |
10 | 2303100122001 |
11 | 808814a82688 |
12 | 3124336a2729 |
13 | 1392487316a3 |
14 | 7d68361bc77 |
15 | 3ed9790b236 |
hex | 2183b76f391 |
2303100122001 has 8 divisors (see below), whose sum is σ = 3509485900224. Its totient is φ = 1316057212560.
The previous prime is 2303100121997. The next prime is 2303100122027. The reversal of 2303100122001 is 1002210013032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2303100122001 - 22 = 2303100121997 is a prime.
It is a super-2 number, since 2×23031001220012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2303100122201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54835717170 + ... + 54835717211.
It is an arithmetic number, because the mean of its divisors is an integer number (438685737528).
Almost surely, 22303100122001 is an apocalyptic number.
2303100122001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2303100122001 is a deficient number, since it is larger than the sum of its proper divisors (1206385778223).
2303100122001 is a wasteful number, since it uses less digits than its factorization.
2303100122001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109671434391.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2303100122001 its reverse (1002210013032), we get a palindrome (3305310135033).
The spelling of 2303100122001 in words is "two trillion, three hundred three billion, one hundred million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •