Base | Representation |
---|---|
bin | 1001100110011000011100… |
… | …00011101101001001001001 |
3 | 2202202002121012111121102110 |
4 | 10303030032003231021021 |
5 | 10231331240012042301 |
6 | 112521444500452533 |
7 | 4306101324216330 |
oct | 463141603551111 |
9 | 82662535447373 |
10 | 21110000112201 |
11 | 67a97787aa370 |
12 | 244b3143aa149 |
13 | ba1883ab8560 |
14 | 52da2d8b6d17 |
15 | 2691bd7180d6 |
hex | 13330e0ed249 |
21110000112201 has 256 divisors, whose sum is σ = 39303125213184. Its totient is φ = 9725184000000.
The previous prime is 21110000112199. The next prime is 21110000112203. The reversal of 21110000112201 is 10221100001112.
It is an interprime number because it is at equal distance from previous prime (21110000112199) and next prime (21110000112203).
It is not a de Polignac number, because 21110000112201 - 21 = 21110000112199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21110000112203) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 4500104266 + ... + 4500108956.
It is an arithmetic number, because the mean of its divisors is an integer number (153527832864).
Almost surely, 221110000112201 is an apocalyptic number.
21110000112201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21110000112201 is a deficient number, since it is larger than the sum of its proper divisors (18193125100983).
21110000112201 is a wasteful number, since it uses less digits than its factorization.
21110000112201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5264.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 21110000112201 its reverse (10221100001112), we get a palindrome (31331100113313).
The spelling of 21110000112201 in words is "twenty-one trillion, one hundred ten billion, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •