Base | Representation |
---|---|
bin | 10111001111011111110010… |
… | …110011010010110001100100 |
3 | 111101221010200120101000002110 |
4 | 113033133302303102301210 |
5 | 101344233030023210040 |
6 | 1001223115251441020 |
7 | 30350102616444450 |
oct | 2717376263226144 |
9 | 441833616330073 |
10 | 102220000210020 |
11 | 2a630293280a50 |
12 | b56ab072b6170 |
13 | 45063c6448884 |
14 | 1b3568dac1660 |
15 | bc3e9b9ce980 |
hex | 5cf7f2cd2c64 |
102220000210020 has 192 divisors, whose sum is σ = 357772433227776. Its totient is φ = 21185060881920.
The previous prime is 102220000209979. The next prime is 102220000210033. The reversal of 102220000210020 is 20012000022201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 102220000209978 and 102220000210005.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27115059 + ... + 30653978.
It is an arithmetic number, because the mean of its divisors is an integer number (1863398089728).
Almost surely, 2102220000210020 is an apocalyptic number.
102220000210020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102220000210020 is an abundant number, since it is smaller than the sum of its proper divisors (255552433017756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102220000210020 is a wasteful number, since it uses less digits than its factorization.
102220000210020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57769450 (or 57769448 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 102220000210020 its reverse (20012000022201), we get a palindrome (122232000232221).
The spelling of 102220000210020 in words is "one hundred two trillion, two hundred twenty billion, two hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •