Base | Representation |
---|---|
bin | 100000000110001011011… |
… | …001100101101110101100 |
3 | 21210212012000201002020010 |
4 | 200012023121211232230 |
5 | 242114141140322022 |
6 | 4405133111253220 |
7 | 315232143566355 |
oct | 40061331455654 |
9 | 7725160632203 |
10 | 2205656964012 |
11 | 780460944857 |
12 | 2b757a07a210 |
13 | 12ccb9863b18 |
14 | 78a7bda6d2c |
15 | 3c592dc950c |
hex | 2018b665bac |
2205656964012 has 12 divisors (see below), whose sum is σ = 5146532916056. Its totient is φ = 735218988000.
The previous prime is 2205656964011. The next prime is 2205656964031. The reversal of 2205656964012 is 2104696565022.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×22056569640122 (a number of 25 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (2205656964011) 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 3 ways as a sum of consecutive naturals, for example, 91902373489 + ... + 91902373512.
Almost surely, 22205656964012 is an apocalyptic number.
It is an amenable number.
2205656964012 is an abundant number, since it is smaller than the sum of its proper divisors (2940875952044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2205656964012 is a wasteful number, since it uses less digits than its factorization.
2205656964012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183804747008 (or 183804747006 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 48.
The spelling of 2205656964012 in words is "two trillion, two hundred five billion, six hundred fifty-six million, nine hundred sixty-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •