Base | Representation |
---|---|
bin | 100000010100100011111… |
… | …000000110001100010110 |
3 | 21212100001021111121001210 |
4 | 200110203320012030112 |
5 | 242342303100000042 |
6 | 4420205333202250 |
7 | 316316633332101 |
oct | 40244370061426 |
9 | 7770037447053 |
10 | 2221100000022 |
11 | 786a66056332 |
12 | 2ba569a90386 |
13 | 1315ab10bb57 |
14 | 79704d95738 |
15 | 3cb98a53a9c |
hex | 20523e06316 |
2221100000022 has 8 divisors (see below), whose sum is σ = 4442200000056. Its totient is φ = 740366666672.
The previous prime is 2221099999897. The next prime is 2221100000029. The reversal of 2221100000022 is 2200000011222.
It is a sphenic number, since it is the product of 3 distinct primes.
2221100000022 is an admirable number.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 2221099999953 and 2221100000007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2221100000029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 185091666663 + ... + 185091666674.
It is an arithmetic number, because the mean of its divisors is an integer number (555275000007).
Almost surely, 22221100000022 is an apocalyptic number.
2221100000022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2221100000022 is a wasteful number, since it uses less digits than its factorization.
2221100000022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 370183333342.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2221100000022 its reverse (2200000011222), we get a palindrome (4421100011244).
The spelling of 2221100000022 in words is "two trillion, two hundred twenty-one billion, one hundred million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •