Base | Representation |
---|---|
bin | 10111000000111101011111… |
… | …101101110100100101001000 |
3 | 111021101122100111121101202012 |
4 | 113000331133231310211020 |
5 | 101231401303112042300 |
6 | 555140155331555052 |
7 | 30214661135633345 |
oct | 2700753755644510 |
9 | 437348314541665 |
10 | 101221100112200 |
11 | 2a28569a203922 |
12 | b4293b175ba88 |
13 | 4463154cc8333 |
14 | 1add1ad78d7cc |
15 | ba7ed6ad0435 |
hex | 5c0f5fb74948 |
101221100112200 has 48 divisors (see below), whose sum is σ = 235339724520180. Its totient is φ = 40488325333760.
The previous prime is 101221100112149. The next prime is 101221100112227. The reversal of 101221100112200 is 2211001122101.
It can be written as a sum of positive squares in 6 ways, for example, as 31372926131716 + 69848173980484 = 5601154^2 + 8357522^2 .
It is a super-2 number, since 2×1012211001122002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 125204474 + ... + 126010326.
Almost surely, 2101221100112200 is an apocalyptic number.
101221100112200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101221100112200 is an abundant number, since it is smaller than the sum of its proper divisors (134118624407980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101221100112200 is a wasteful number, since it uses less digits than its factorization.
101221100112200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1433906 (or 1433897 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101221100112200 its reverse (2211001122101), we get a palindrome (103432101234301).
The spelling of 101221100112200 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •