Base | Representation |
---|---|
bin | 100000000001110111000… |
… | …101001011010010011100 |
3 | 21210102012221111211222220 |
4 | 200001313011023102130 |
5 | 242030142400214322 |
6 | 4403045104505340 |
7 | 315006232446363 |
oct | 40016705132234 |
9 | 7712187454886 |
10 | 2201021101212 |
11 | 7794a203848a |
12 | 2b66a561b250 |
13 | 12c72b29b13b |
14 | 7875c4127da |
15 | 3c3c0e0055c |
hex | 2007714b49c |
2201021101212 has 48 divisors (see below), whose sum is σ = 5254403696640. Its totient is φ = 716774356672.
The previous prime is 2201021101183. The next prime is 2201021101229. The reversal of 2201021101212 is 2121011201022.
It is a super-3 number, since 3×22010211012123 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2201021101191 and 2201021101200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3189012 + ... + 3817307.
It is an arithmetic number, because the mean of its divisors is an integer number (109466743680).
Almost surely, 22201021101212 is an apocalyptic number.
It is an amenable number.
2201021101212 is an abundant number, since it is smaller than the sum of its proper divisors (3053382595428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201021101212 is a wasteful number, since it uses less digits than its factorization.
2201021101212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7006930 (or 7006928 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2201021101212 its reverse (2121011201022), we get a palindrome (4322032302234).
The spelling of 2201021101212 in words is "two trillion, two hundred one billion, twenty-one million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •