Base | Representation |
---|---|
bin | 100000001011010110100… |
… | …000110101011110010010 |
3 | 21211101112011201100101100 |
4 | 200023112200311132102 |
5 | 242212030300401002 |
6 | 4411452233445230 |
7 | 315516616630302 |
oct | 40132640653622 |
9 | 7741464640340 |
10 | 2211212122002 |
11 | 782851662214 |
12 | 2b866a570816 |
13 | 13069371a860 |
14 | 79047a9b602 |
15 | 3c7ba94211c |
hex | 202d6835792 |
2211212122002 has 96 divisors (see below), whose sum is σ = 5276839696128. Its totient is φ = 664996595328.
The previous prime is 2211212121997. The next prime is 2211212122013. The reversal of 2211212122002 is 2002212121122.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2922763 + ... + 3600689.
It is an arithmetic number, because the mean of its divisors is an integer number (54967080168).
Almost surely, 22211212122002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2211212122002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2638419848064).
2211212122002 is an abundant number, since it is smaller than the sum of its proper divisors (3065627574126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211212122002 is a wasteful number, since it uses less digits than its factorization.
2211212122002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 678264 (or 678261 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2211212122002 its reverse (2002212121122), we get a palindrome (4213424243124).
The spelling of 2211212122002 in words is "two trillion, two hundred eleven billion, two hundred twelve million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •