Base | Representation |
---|---|
bin | 10111000000101010000010… |
… | …101100110001001001110100 |
3 | 111021022122102210022121211012 |
4 | 113000222002230301021310 |
5 | 101231031013310431400 |
6 | 555122422523331352 |
7 | 30213321412423304 |
oct | 2700520254611164 |
9 | 437278383277735 |
10 | 101200212202100 |
11 | 2a27785055a900 |
12 | b425342380b58 |
13 | 44611a669ac0b |
14 | 1adc18b5b7604 |
15 | ba76b2e24d35 |
hex | 5c0a82b31274 |
101200212202100 has 108 divisors (see below), whose sum is σ = 246519233967552. Its totient is φ = 36017096596800.
The previous prime is 101200212202097. The next prime is 101200212202211. The reversal of 101200212202100 is 1202212002101.
It is a super-3 number, since 3×1012002122021003 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
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 35 ways as a sum of consecutive naturals, for example, 88406342 + ... + 89543741.
Almost surely, 2101200212202100 is an apocalyptic number.
101200212202100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101200212202100 is an abundant number, since it is smaller than the sum of its proper divisors (145319021765452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101200212202100 is a wasteful number, since it uses less digits than its factorization.
101200212202100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177950166 (or 177950148 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101200212202100 its reverse (1202212002101), we get a palindrome (102402424204201).
The spelling of 101200212202100 in words is "one hundred one trillion, two hundred billion, two hundred twelve million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •