Base | Representation |
---|---|
bin | 10111000000111100011111… |
… | …011101001111000000111000 |
3 | 111021101112120100222202021221 |
4 | 113000330133131033000320 |
5 | 101231342101114202300 |
6 | 555135500340441424 |
7 | 30214622335212664 |
oct | 2700743735170070 |
9 | 437345510882257 |
10 | 101220022022200 |
11 | 2a2851966a3954 |
12 | b4291506a9274 |
13 | 4463012849263 |
14 | 1add10a5158a4 |
15 | ba7e7212631a |
hex | 5c0f1f74f038 |
101220022022200 has 24 divisors (see below), whose sum is σ = 235336551202080. Its totient is φ = 40488008808800.
The previous prime is 101220022022107. The next prime is 101220022022209. The reversal of 101220022022200 is 2220220022101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101220022022209) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 253050054856 + ... + 253050055255.
It is an arithmetic number, because the mean of its divisors is an integer number (9805689633420).
Almost surely, 2101220022022200 is an apocalyptic number.
101220022022200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101220022022200 is an abundant number, since it is smaller than the sum of its proper divisors (134116529179880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101220022022200 is a wasteful number, since it uses less digits than its factorization.
101220022022200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 506100110127 (or 506100110118 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 101220022022200 its reverse (2220220022101), we get a palindrome (103440242044301).
The spelling of 101220022022200 in words is "one hundred one trillion, two hundred twenty billion, twenty-two million, twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •