Base | Representation |
---|---|
bin | 10100101101110000… |
… | …11001001000110111 |
3 | 1001201001200120120212 |
4 | 22112320121020313 |
5 | 140234023100043 |
6 | 5035320020035 |
7 | 542411330141 |
oct | 122670311067 |
9 | 31631616525 |
10 | 11121300023 |
11 | 4797758349 |
12 | 21a460161b |
13 | 10830b8202 |
14 | 777047c91 |
15 | 451550018 |
hex | 296e19237 |
11121300023 has 12 divisors (see below), whose sum is σ = 11819156160. Its totient is φ = 10462516992.
The previous prime is 11121300007. The next prime is 11121300083. The reversal of 11121300023 is 32000312111.
11121300023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11121300023 - 24 = 11121300007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11121299980 and 11121300007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121300083) 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 11 ways as a sum of consecutive naturals, for example, 778715 + ... + 792867.
It is an arithmetic number, because the mean of its divisors is an integer number (984929680).
Almost surely, 211121300023 is an apocalyptic number.
11121300023 is a deficient number, since it is larger than the sum of its proper divisors (697856137).
11121300023 is a wasteful number, since it uses less digits than its factorization.
11121300023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16906 (or 16889 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 11121300023 its reverse (32000312111), we get a palindrome (43121612134).
The spelling of 11121300023 in words is "eleven billion, one hundred twenty-one million, three hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •