Base | Representation |
---|---|
bin | 10010101010110101… |
… | …10111010000001011 |
3 | 221212112010012002010 |
4 | 21111122313100023 |
5 | 131011344240021 |
6 | 4334324311003 |
7 | 503244301665 |
oct | 112532672013 |
9 | 27775105063 |
10 | 10023040011 |
11 | 4283821346 |
12 | 1b38842463 |
13 | c396c650a |
14 | 6b123d535 |
15 | 3d9e0e976 |
hex | 2556b740b |
10023040011 has 8 divisors (see below), whose sum is σ = 13365861264. Its totient is φ = 6681122720.
The previous prime is 10023039977. The next prime is 10023040057. The reversal of 10023040011 is 11004032001.
It is a happy number.
10023040011 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
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 10023040011 - 27 = 10023039883 is a prime.
It is a super-2 number, since 2×100230400112 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10023044011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199680 + ... + 244781.
It is an arithmetic number, because the mean of its divisors is an integer number (1670732658).
Almost surely, 210023040011 is an apocalyptic number.
10023040011 is a deficient number, since it is larger than the sum of its proper divisors (3342821253).
10023040011 is an equidigital number, since it uses as much as digits as its factorization.
10023040011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451981.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10023040011 its reverse (11004032001), we get a palindrome (21027072012).
The spelling of 10023040011 in words is "ten billion, twenty-three million, forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •