Base | Representation |
---|---|
bin | 1011011101111100010010… |
… | …0101110011001110100101 |
3 | 1122122102002210022100012220 |
4 | 2313133010211303032211 |
5 | 3123041241434213003 |
6 | 42452301313502553 |
7 | 2440654310204550 |
oct | 267370445631645 |
9 | 48572083270186 |
10 | 12609027257253 |
11 | 4021505196389 |
12 | 14b7869871a59 |
13 | 706045651b1b |
14 | 3183ccb31697 |
15 | 16ceca551353 |
hex | b77c49733a5 |
12609027257253 has 32 divisors (see below), whose sum is σ = 19595386981632. Its totient is φ = 7062853017600.
The previous prime is 12609027257251. The next prime is 12609027257303. The reversal of 12609027257253 is 35275272090621.
It is a happy number.
It is not a de Polignac number, because 12609027257253 - 21 = 12609027257251 is a prime.
It is a super-2 number, since 2×126090272572532 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12609027257196 and 12609027257205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12609027257251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16421788 + ... + 17172453.
It is an arithmetic number, because the mean of its divisors is an integer number (612355843176).
Almost surely, 212609027257253 is an apocalyptic number.
It is an amenable number.
12609027257253 is a deficient number, since it is larger than the sum of its proper divisors (6986359724379).
12609027257253 is a wasteful number, since it uses less digits than its factorization.
12609027257253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33594605.
The product of its (nonzero) digits is 3175200, while the sum is 51.
The spelling of 12609027257253 in words is "twelve trillion, six hundred nine billion, twenty-seven million, two hundred fifty-seven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •