Base | Representation |
---|---|
bin | 1001000111001111110111… |
… | …0100000100100100011001 |
3 | 1022110220200112100210012212 |
4 | 2101303331310010210121 |
5 | 2303132202214120441 |
6 | 33151102553444505 |
7 | 2052633651605063 |
oct | 221637564044431 |
9 | 38426615323185 |
10 | 10020122020121 |
11 | 3213567724614 |
12 | 1159b72710735 |
13 | 578b7cbb66c5 |
14 | 268d956d8733 |
15 | 1259a6762eeb |
hex | 91cfdd04919 |
10020122020121 has 16 divisors (see below), whose sum is σ = 10087229265984. Its totient is φ = 9953230005504.
The previous prime is 10020122020091. The next prime is 10020122020141. The reversal of 10020122020121 is 12102022102001.
It is a cyclic number.
It is not a de Polignac number, because 10020122020121 - 214 = 10020122003737 is a prime.
It is a super-2 number, since 2×100201220201212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10020122020096 and 10020122020105.
It is not an unprimeable number, because it can be changed into a prime (10020122020141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 978235826 + ... + 978246068.
It is an arithmetic number, because the mean of its divisors is an integer number (630451829124).
Almost surely, 210020122020121 is an apocalyptic number.
It is an amenable number.
10020122020121 is a deficient number, since it is larger than the sum of its proper divisors (67107245863).
10020122020121 is a wasteful number, since it uses less digits than its factorization.
10020122020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20120.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10020122020121 its reverse (12102022102001), we get a palindrome (22122144122122).
The spelling of 10020122020121 in words is "ten trillion, twenty billion, one hundred twenty-two million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •