Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …001001001001101010100000 |
3 | 111010210010022010102212012002 |
4 | 112302013131021021222200 |
5 | 101113143123031241000 |
6 | 553035412133423132 |
7 | 30051166146562154 |
oct | 2662073511115240 |
9 | 433703263385162 |
10 | 100201002212000 |
11 | 29a22008572058 |
12 | b2a3760a9aaa8 |
13 | 43babb5c98071 |
14 | 1aa5a7c059064 |
15 | b8b6d0c108d5 |
hex | 5b21dd249aa0 |
100201002212000 has 48 divisors (see below), whose sum is σ = 246193862444712. Its totient is φ = 40080400883200.
The previous prime is 100201002211943. The next prime is 100201002212009. The reversal of 100201002212000 is 212200102001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 22517720240656 + 77683281971344 = 4745284^2 + 8813812^2 .
It is not an unprimeable number, because it can be changed into a prime (100201002212009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12525121277 + ... + 12525129276.
Almost surely, 2100201002212000 is an apocalyptic number.
100201002212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100201002212000 is an abundant number, since it is smaller than the sum of its proper divisors (145992860232712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201002212000 is an equidigital number, since it uses as much as digits as its factorization.
100201002212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25050250578 (or 25050250560 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 100201002212000 its reverse (212200102001), we get a palindrome (100413202314001).
The spelling of 100201002212000 in words is "one hundred trillion, two hundred one billion, two million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •