Base | Representation |
---|---|
bin | 10111100100011011… |
… | …01010111001100001 |
3 | 1012122211222201002122 |
4 | 23302031222321201 |
5 | 201403310320244 |
6 | 5451334354025 |
7 | 625365602033 |
oct | 136215527141 |
9 | 35584881078 |
10 | 12653604449 |
11 | 54036a2342 |
12 | 25517bb915 |
13 | 12686ab315 |
14 | 880759c53 |
15 | 4e0d2b1ee |
hex | 2f236ae61 |
12653604449 has 4 divisors (see below), whose sum is σ = 12656425236. Its totient is φ = 12650783664.
The previous prime is 12653604443. The next prime is 12653604497. The reversal of 12653604449 is 94440635621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 94440635621 = 12161 ⋅7765861.
It can be written as a sum of positive squares in 2 ways, for example, as 12035187025 + 618417424 = 109705^2 + 24868^2 .
It is a cyclic number.
It is not a de Polignac number, because 12653604449 - 212 = 12653600353 is a prime.
It is a super-2 number, since 2×126536044492 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12653604443) 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, 1403654 + ... + 1412639.
It is an arithmetic number, because the mean of its divisors is an integer number (3164106309).
Almost surely, 212653604449 is an apocalyptic number.
It is an amenable number.
12653604449 is a deficient number, since it is larger than the sum of its proper divisors (2820787).
12653604449 is an equidigital number, since it uses as much as digits as its factorization.
12653604449 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2820786.
The product of its (nonzero) digits is 622080, while the sum is 44.
The spelling of 12653604449 in words is "twelve billion, six hundred fifty-three million, six hundred four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •