Base | Representation |
---|---|
bin | 10110110010011001001010… |
… | …000110001100010101000010 |
3 | 111010211221100210222122220211 |
4 | 112302121022012030111002 |
5 | 101114001040031202320 |
6 | 553052234221024334 |
7 | 30052441163364361 |
oct | 2662311206142502 |
9 | 433757323878824 |
10 | 100220010022210 |
11 | 29a2a081a22211 |
12 | b2a73866b50aa |
13 | 43bc924c3b740 |
14 | 1aa69626677d8 |
15 | b8be447de55a |
hex | 5b264a18c542 |
100220010022210 has 64 divisors (see below), whose sum is σ = 204663909945600. Its totient is φ = 35028190409472.
The previous prime is 100220010022207. The next prime is 100220010022261. The reversal of 100220010022210 is 12220010022001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13471654 + ... + 19542913.
It is an arithmetic number, because the mean of its divisors is an integer number (3197873592900).
Almost surely, 2100220010022210 is an apocalyptic number.
100220010022210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100220010022210 is an abundant number, since it is smaller than the sum of its proper divisors (104443899923390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100220010022210 is a wasteful number, since it uses less digits than its factorization.
100220010022210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33015835.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100220010022210 its reverse (12220010022001), we get a palindrome (112440020044211).
The spelling of 100220010022210 in words is "one hundred trillion, two hundred twenty billion, ten million, twenty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •