Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …111001011110100100111010 |
3 | 111020200102120022020111220121 |
4 | 112332002103321132210322 |
5 | 101220103142200320442 |
6 | 554503555425443454 |
7 | 30164314360120066 |
oct | 2676022371364472 |
9 | 436612508214817 |
10 | 101020112120122 |
11 | 2a208430780648 |
12 | b3b645b1a058a |
13 | 444a2040b4780 |
14 | 1ad35843a8aa6 |
15 | ba2b71a4c967 |
hex | 5be093e5e93a |
101020112120122 has 32 divisors (see below), whose sum is σ = 164805370329600. Its totient is φ = 46162276272000.
The previous prime is 101020112120077. The next prime is 101020112120167. The reversal of 101020112120122 is 221021211020101.
101020112120122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (101020112120077) and next prime (101020112120167).
It is a junction number, because it is equal to n+sod(n) for n = 101020112120096 and 101020112120105.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8753254 + ... + 16693102.
It is an arithmetic number, because the mean of its divisors is an integer number (5150167822800).
Almost surely, 2101020112120122 is an apocalyptic number.
101020112120122 is a deficient number, since it is larger than the sum of its proper divisors (63785258209478).
101020112120122 is a wasteful number, since it uses less digits than its factorization.
101020112120122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7944718.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101020112120122 its reverse (221021211020101), we get a palindrome (322041323140223).
The spelling of 101020112120122 in words is "one hundred one trillion, twenty billion, one hundred twelve million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •