Base | Representation |
---|---|
bin | 1010000111011001000011… |
… | …1100011110000000101101 |
3 | 1110101021002102022000220220 |
4 | 2201312100330132000231 |
5 | 2424211031114200023 |
6 | 35353231223201553 |
7 | 2225355026000232 |
oct | 241662074360055 |
9 | 43337072260826 |
10 | 11122102100013 |
11 | 35a8947756973 |
12 | 12b76555a62b9 |
13 | 628a6ac83088 |
14 | 2a6453b53789 |
15 | 1444a0e8e3e3 |
hex | a1d90f1e02d |
11122102100013 has 32 divisors (see below), whose sum is σ = 15099075648000. Its totient is φ = 7281394154496.
The previous prime is 11122102099967. The next prime is 11122102100099. The reversal of 11122102100013 is 31000120122111.
It is not a de Polignac number, because 11122102100013 - 221 = 11122100002861 is a prime.
It is a super-2 number, since 2×111221021000132 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11122102099965 and 11122102100001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122102170013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19775548 + ... + 20330186.
It is an arithmetic number, because the mean of its divisors is an integer number (471846114000).
Almost surely, 211122102100013 is an apocalyptic number.
It is an amenable number.
11122102100013 is a deficient number, since it is larger than the sum of its proper divisors (3976973547987).
11122102100013 is a wasteful number, since it uses less digits than its factorization.
11122102100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 555301.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11122102100013 its reverse (31000120122111), we get a palindrome (42122222222124).
The spelling of 11122102100013 in words is "eleven trillion, one hundred twenty-two billion, one hundred two million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •