Base | Representation |
---|---|
bin | 10110111110000100010000… |
… | …011010011000110101001001 |
3 | 111020200121221220001210221000 |
4 | 112332010100122120311021 |
5 | 101220121431441401441 |
6 | 554504543012205213 |
7 | 30164420214256656 |
oct | 2676042032306511 |
9 | 436617856053830 |
10 | 101022201122121 |
11 | 2a209302987784 |
12 | b3b6942909809 |
13 | 444a477b21726 |
14 | 1ad37019d0c2d |
15 | ba2c451412b6 |
hex | 5be110698d49 |
101022201122121 has 32 divisors (see below), whose sum is σ = 151520262320000. Its totient is φ = 66517171052544.
The previous prime is 101022201122113. The next prime is 101022201122153. The reversal of 101022201122121 is 121221102220101.
It is not a de Polignac number, because 101022201122121 - 23 = 101022201122113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101022201122094 and 101022201122103.
It is not an unprimeable number, because it can be changed into a prime (101022201122021) 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, 69010696 + ... + 70459353.
It is an arithmetic number, because the mean of its divisors is an integer number (4735008197500).
Almost surely, 2101022201122121 is an apocalyptic number.
It is an amenable number.
101022201122121 is a deficient number, since it is larger than the sum of its proper divisors (50498061197879).
101022201122121 is a wasteful number, since it uses less digits than its factorization.
101022201122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139470390 (or 139470384 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 101022201122121 its reverse (121221102220101), we get a palindrome (222243303342222).
The spelling of 101022201122121 in words is "one hundred one trillion, twenty-two billion, two hundred one million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •