Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …0111010010111110011011 |
3 | 1022102221120020210000011121 |
4 | 2101222202213102332123 |
5 | 2303000441003310021 |
6 | 33142310442510111 |
7 | 2052125116130323 |
oct | 221524247227633 |
9 | 38387506700147 |
10 | 10010002010011 |
11 | 320a2441a11a3 |
12 | 1158009505337 |
13 | 577c2939a843 |
14 | 2686b5656283 |
15 | 1255b309b741 |
hex | 91aa29d2f9b |
10010002010011 has 8 divisors (see below), whose sum is σ = 10023806799360. Its totient is φ = 9996197923368.
The previous prime is 10010002009963. The next prime is 10010002010051. The reversal of 10010002010011 is 11001020001001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10010002010011 - 213 = 10010002001819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10010002009976 and 10010002010003.
It is not an unprimeable number, because it can be changed into a prime (10010002010051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32515770 + ... + 32822176.
It is an arithmetic number, because the mean of its divisors is an integer number (1252975849920).
Almost surely, 210010002010011 is an apocalyptic number.
10010002010011 is a deficient number, since it is larger than the sum of its proper divisors (13804789349).
10010002010011 is an equidigital number, since it uses as much as digits as its factorization.
10010002010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351353.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10010002010011 its reverse (11001020001001), we get a palindrome (21011022011012).
The spelling of 10010002010011 in words is "ten trillion, ten billion, two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •