Base | Representation |
---|---|
bin | 100000010101011101010… |
… | …101101101100001011000 |
3 | 21212102112110120011001021 |
4 | 200111131111231201120 |
5 | 242401241400031400 |
6 | 4420445132332224 |
7 | 316352550624022 |
oct | 40253525554130 |
9 | 7772473504037 |
10 | 2222064064600 |
11 | 787410265316 |
12 | 2ba798914074 |
13 | 131702a76573 |
14 | 7979702b012 |
15 | 3cc034d771a |
hex | 2055d56d858 |
2222064064600 has 48 divisors (see below), whose sum is σ = 5228543554920. Its totient is φ = 878116876800.
The previous prime is 2222064064589. The next prime is 2222064064601. The reversal of 2222064064600 is 64604602222.
It is a super-3 number, since 3×22220640646003 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222064064601) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 66913041 + ... + 66946240.
Almost surely, 22222064064600 is an apocalyptic number.
2222064064600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2222064064600 is an abundant number, since it is smaller than the sum of its proper divisors (3006479490320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2222064064600 is a wasteful number, since it uses less digits than its factorization.
2222064064600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133859380 (or 133859371 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 2222064064600 its reverse (64604602222), we get a palindrome (2286668666822).
The spelling of 2222064064600 in words is "two trillion, two hundred twenty-two billion, sixty-four million, sixty-four thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •