Base | Representation |
---|---|
bin | 100000010100011101111… |
… | …110011100100000110100 |
3 | 21212022210101012220221210 |
4 | 200110131332130200310 |
5 | 242342102224013022 |
6 | 4420151435241420 |
7 | 316314322006203 |
oct | 40243576344064 |
9 | 7768711186853 |
10 | 2221001001012 |
11 | 786a15188972 |
12 | 2ba5408a9270 |
13 | 131593758b61 |
14 | 796d5b8523a |
15 | 3cb8eeeaa0c |
hex | 2051df9c834 |
2221001001012 has 12 divisors (see below), whose sum is σ = 5182335669056. Its totient is φ = 740333667000.
The previous prime is 2221001001001. The next prime is 2221001001049. The reversal of 2221001001012 is 2101001001222.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 185083416751 = 2221001001012 / (2 + 2 + 2 + 1 + 0 + 0 + 1 + 0 + 0 + 1 + 0 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92541708364 + ... + 92541708387.
Almost surely, 22221001001012 is an apocalyptic number.
It is an amenable number.
2221001001012 is an abundant number, since it is smaller than the sum of its proper divisors (2961334668044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2221001001012 is a wasteful number, since it uses less digits than its factorization.
2221001001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185083416758 (or 185083416756 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2221001001012 its reverse (2101001001222), we get a palindrome (4322002002234).
The spelling of 2221001001012 in words is "two trillion, two hundred twenty-one billion, one million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •