Base | Representation |
---|---|
bin | 10111001100100111011001… |
… | …001100011110111001000110 |
3 | 111101020012121202000101010120 |
4 | 113030213121030132321012 |
5 | 101333012030020010042 |
6 | 1000552132153202410 |
7 | 30326563214404551 |
oct | 2714473114367106 |
9 | 441205552011116 |
10 | 102022002110022 |
11 | 2a564319534965 |
12 | b53866a100406 |
13 | 44c0830aba817 |
14 | 1b29c69831698 |
15 | bbdc5e195dec |
hex | 5cc9d931ee46 |
102022002110022 has 32 divisors (see below), whose sum is σ = 216290162898432. Its totient is φ = 31970818149504.
The previous prime is 102022002109997. The next prime is 102022002110143. The reversal of 102022002110022 is 220011200220201.
It is a junction number, because it is equal to n+sod(n) for n = 102022002109983 and 102022002110010.
It is a congruent number.
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, 563728978 + ... + 563909925.
It is an arithmetic number, because the mean of its divisors is an integer number (6759067590576).
Almost surely, 2102022002110022 is an apocalyptic number.
102022002110022 is an abundant number, since it is smaller than the sum of its proper divisors (114268160788410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102022002110022 is a wasteful number, since it uses less digits than its factorization.
102022002110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1127639812.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102022002110022 its reverse (220011200220201), we get a palindrome (322033202330223).
The spelling of 102022002110022 in words is "one hundred two trillion, twenty-two billion, two million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •