Base | Representation |
---|---|
bin | 10110101111001110010011… |
… | …101011100011010000000100 |
3 | 111010002010011100022002121002 |
4 | 112233032103223203100010 |
5 | 101101414002003020400 |
6 | 552404213234312432 |
7 | 30030630525202454 |
oct | 2657162353432004 |
9 | 433063140262532 |
10 | 100002201220100 |
11 | 2995577159a443 |
12 | b27111aa28718 |
13 | 43a52231b3a4a |
14 | 1a9a1bd2c9d64 |
15 | b86447b7ced5 |
hex | 5af393ae3404 |
100002201220100 has 36 divisors (see below), whose sum is σ = 217009142275968. Its totient is φ = 40000075764000.
The previous prime is 100002201220093. The next prime is 100002201220153. The reversal of 100002201220100 is 1022102200001.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5051036 + ... + 15017235.
It is an arithmetic number, because the mean of its divisors is an integer number (6028031729888).
Almost surely, 2100002201220100 is an apocalyptic number.
100002201220100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100002201220100 is an abundant number, since it is smaller than the sum of its proper divisors (117006941055868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100002201220100 is a wasteful number, since it uses less digits than its factorization.
100002201220100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20118116 (or 20118109 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 100002201220100 its reverse (1022102200001), we get a palindrome (101024303420101).
The spelling of 100002201220100 in words is "one hundred trillion, two billion, two hundred one million, two hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •