Base | Representation |
---|---|
bin | 10111001101111010010011… |
… | …000100110111100111000010 |
3 | 111101112201101112220212001020 |
4 | 113031322103010313213002 |
5 | 101340441332111202320 |
6 | 1001101053252050310 |
7 | 30336164160232413 |
oct | 2715722304674702 |
9 | 441481345825036 |
10 | 102111020022210 |
11 | 2a599049856931 |
12 | b551972003996 |
13 | 44c9049304944 |
14 | 1b302b212580a |
15 | bc121e1cd940 |
hex | 5cde931379c2 |
102111020022210 has 64 divisors (see below), whose sum is σ = 245601390504960. Its totient is φ = 27170231742720.
The previous prime is 102111020022169. The next prime is 102111020022241. The reversal of 102111020022210 is 12220020111201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 102111020022210.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23346436 + ... + 27372944.
It is an arithmetic number, because the mean of its divisors is an integer number (3837521726640).
Almost surely, 2102111020022210 is an apocalyptic number.
102111020022210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102111020022210 is an abundant number, since it is smaller than the sum of its proper divisors (143490370482750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111020022210 is a wasteful number, since it uses less digits than its factorization.
102111020022210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4028363.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102111020022210 its reverse (12220020111201), we get a palindrome (114331040133411).
The spelling of 102111020022210 in words is "one hundred two trillion, one hundred eleven billion, twenty million, twenty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •