Base | Representation |
---|---|
bin | 100000010100011110000… |
… | …010010000011010101010 |
3 | 21212022210110002200100220 |
4 | 200110132002100122222 |
5 | 242342103003000132 |
6 | 4420151512510510 |
7 | 316314333336630 |
oct | 40243602203252 |
9 | 7768713080326 |
10 | 2221002000042 |
11 | 786a15800511 |
12 | 2ba5410ab436 |
13 | 131593a187b7 |
14 | 796d5d65350 |
15 | 3cb90146a2c |
hex | 2051e0906aa |
2221002000042 has 256 divisors, whose sum is σ = 5310403338240. Its totient is φ = 606285388800.
The previous prime is 2221002000011. The next prime is 2221002000043. The reversal of 2221002000042 is 2400002001222.
It is a junction number, because it is equal to n+sod(n) for n = 2221001999985 and 2221002000030.
It is not an unprimeable number, because it can be changed into a prime (2221002000043) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4523425417 + ... + 4523425907.
It is an arithmetic number, because the mean of its divisors is an integer number (20743763040).
Almost surely, 22221002000042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2221002000042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2655201669120).
2221002000042 is an abundant number, since it is smaller than the sum of its proper divisors (3089401338198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2221002000042 is a wasteful number, since it uses less digits than its factorization.
2221002000042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 2221002000042 its reverse (2400002001222), we get a palindrome (4621004001264).
The spelling of 2221002000042 in words is "two trillion, two hundred twenty-one billion, two million, forty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •