Base | Representation |
---|---|
bin | 10111000000111110100001… |
… | …110111110010001100000100 |
3 | 111021101202012212002120011012 |
4 | 113000332201313302030010 |
5 | 101231411041231120400 |
6 | 555140501421101352 |
7 | 30215030503663421 |
oct | 2700764167621404 |
9 | 437352185076135 |
10 | 101222210020100 |
11 | 2a286109776084 |
12 | b4296613b7858 |
13 | 44632a0c37980 |
14 | 1add276d4ad48 |
15 | ba804e271d35 |
hex | 5c0fa1df2304 |
101222210020100 has 144 divisors (see below), whose sum is σ = 249014209987200. Its totient is φ = 35405040798720.
The previous prime is 101222210020069. The next prime is 101222210020147. The reversal of 101222210020100 is 1020012222101.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 417036977 + ... + 417279623.
Almost surely, 2101222210020100 is an apocalyptic number.
101222210020100 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 101222210020100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124507104993600).
101222210020100 is an abundant number, since it is smaller than the sum of its proper divisors (147791999967100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101222210020100 is a wasteful number, since it uses less digits than its factorization.
101222210020100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259582 (or 259575 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101222210020100 its reverse (1020012222101), we get a palindrome (102242222242201).
The spelling of 101222210020100 in words is "one hundred one trillion, two hundred twenty-two billion, two hundred ten million, twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •