Base | Representation |
---|---|
bin | 100000010100011101111… |
… | …110011100010010110000 |
3 | 21212022210101012212201110 |
4 | 200110131332130102300 |
5 | 242342102224000422 |
6 | 4420151435233320 |
7 | 316314322003446 |
oct | 40243576342260 |
9 | 7768711185643 |
10 | 2221001000112 |
11 | 786a15188224 |
12 | 2ba5408a8840 |
13 | 13159375861b |
14 | 796d5b84b96 |
15 | 3cb8eeea60c |
hex | 2051df9c4b0 |
2221001000112 has 160 divisors (see below), whose sum is σ = 5992466171904. Its totient is φ = 708035328000.
The previous prime is 2221001000089. The next prime is 2221001000129. The reversal of 2221001000112 is 2110001001222.
It is a Harshad number since it is a multiple of its sum of digits (12).
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 31 ways as a sum of consecutive naturals, for example, 82194028 + ... + 82221044.
Almost surely, 22221001000112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2221001000112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2996233085952).
2221001000112 is an abundant number, since it is smaller than the sum of its proper divisors (3771465171792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2221001000112 is a wasteful number, since it uses less digits than its factorization.
2221001000112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27707 (or 27701 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2221001000112 its reverse (2110001001222), we get a palindrome (4331002001334).
The spelling of 2221001000112 in words is "two trillion, two hundred twenty-one billion, one million, one hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •