Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0000110100110101101000 |
3 | 1100010022122212101121102101 |
4 | 2110131202200310311220 |
5 | 2314123101211201300 |
6 | 33410454230543144 |
7 | 2102041013005513 |
oct | 224354240646550 |
9 | 40108585347371 |
10 | 10202200100200 |
11 | 3283801a93049 |
12 | 1189308207ab4 |
13 | 5900a9212824 |
14 | 273b094b5d7a |
15 | 12a5b1603b6a |
hex | 94762834d68 |
10202200100200 has 96 divisors (see below), whose sum is σ = 25029531489600. Its totient is φ = 3859591324160.
The previous prime is 10202200100149. The next prime is 10202200100227. The reversal of 10202200100200 is 200100220201.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 23 ways as a sum of consecutive naturals, for example, 12050542 + ... + 12869341.
It is an arithmetic number, because the mean of its divisors is an integer number (260724286350).
Almost surely, 210202200100200 is an apocalyptic number.
10202200100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10202200100200 is an abundant number, since it is smaller than the sum of its proper divisors (14827331389400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202200100200 is a wasteful number, since it uses less digits than its factorization.
10202200100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24920011 (or 24920002 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10202200100200 its reverse (200100220201), we get a palindrome (10402300320401).
The spelling of 10202200100200 in words is "ten trillion, two hundred two billion, two hundred million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •