Base | Representation |
---|---|
bin | 101111001000000011… |
… | …1110000101001110000 |
3 | 100200012221210111021002 |
4 | 1132100013300221300 |
5 | 3124230230414300 |
6 | 114254110221132 |
7 | 10211612342162 |
oct | 1362007605160 |
9 | 320187714232 |
10 | 101202201200 |
11 | 39a13005711 |
12 | 177444b47a8 |
13 | 970a8c4ab9 |
14 | 4c809a4932 |
15 | 2974a5c5d5 |
hex | 17901f0a70 |
101202201200 has 120 divisors (see below), whose sum is σ = 245107632048. Its totient is φ = 40154019840.
The previous prime is 101202201193. The next prime is 101202201227. The reversal of 101202201200 is 2102202101.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42574412 + ... + 42576788.
Almost surely, 2101202201200 is an apocalyptic number.
101202201200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101202201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122553816024).
101202201200 is an abundant number, since it is smaller than the sum of its proper divisors (143905430848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101202201200 is a wasteful number, since it uses less digits than its factorization.
101202201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3211 (or 3200 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 101202201200 its reverse (2102202101), we get a palindrome (103304403301).
Subtracting from 101202201200 its reverse (2102202101), we obtain a palindrome (99099999099).
The spelling of 101202201200 in words is "one hundred one billion, two hundred two million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •