Base | Representation |
---|---|
bin | 11101101100000110110… |
… | …10100000001101011001 |
3 | 10121112002100201111110212 |
4 | 32312003122200031121 |
5 | 113203142133341441 |
6 | 2100344420420505 |
7 | 133462220014616 |
oct | 16660332401531 |
9 | 3545070644425 |
10 | 1020112012121 |
11 | 363699700314 |
12 | 145855547735 |
13 | 75271c31627 |
14 | 3753356950d |
15 | 1b80725aeeb |
hex | ed836a0359 |
1020112012121 has 16 divisors (see below), whose sum is σ = 1029354117120. Its totient is φ = 1010899111440.
The previous prime is 1020112012111. The next prime is 1020112012141. The reversal of 1020112012121 is 1212102110201.
It is a cyclic number.
It is not a de Polignac number, because 1020112012121 - 234 = 1002932142937 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1020112012096 and 1020112012105.
It is not an unprimeable number, because it can be changed into a prime (1020112012111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 213098090 + ... + 213102876.
It is an arithmetic number, because the mean of its divisors is an integer number (64334632320).
Almost surely, 21020112012121 is an apocalyptic number.
It is an amenable number.
1020112012121 is a deficient number, since it is larger than the sum of its proper divisors (9242104999).
1020112012121 is a wasteful number, since it uses less digits than its factorization.
1020112012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7444.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1020112012121 its reverse (1212102110201), we get a palindrome (2232214122322).
The spelling of 1020112012121 in words is "one trillion, twenty billion, one hundred twelve million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.597 sec. • engine limits •