Base | Representation |
---|---|
bin | 10111001101101000… |
… | …10011101001101101 |
3 | 1012011112012211110222 |
4 | 23212310103221231 |
5 | 201010334000003 |
6 | 5420344341125 |
7 | 620554463633 |
oct | 134664235155 |
9 | 35145184428 |
10 | 12462406253 |
11 | 5315781300 |
12 | 24b97747a5 |
13 | 1237bb63ab |
14 | 8631c9353 |
15 | 4ce15ec38 |
hex | 2e6d13a6d |
12462406253 has 24 divisors (see below), whose sum is σ = 13922536824. Its totient is φ = 11145559040.
The previous prime is 12462406249. The next prime is 12462406301. The reversal of 12462406253 is 35260426421.
It can be written as a sum of positive squares in 4 ways, for example, as 511981129 + 11950425124 = 22627^2 + 109318^2 .
It is not a de Polignac number, because 12462406253 - 22 = 12462406249 is a prime.
It is a super-2 number, since 2×124624062532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12462406153) 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 23 ways as a sum of consecutive naturals, for example, 1869875 + ... + 1876527.
It is an arithmetic number, because the mean of its divisors is an integer number (580105701).
Almost surely, 212462406253 is an apocalyptic number.
It is an amenable number.
12462406253 is a deficient number, since it is larger than the sum of its proper divisors (1460130571).
12462406253 is a wasteful number, since it uses less digits than its factorization.
12462406253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6925 (or 6914 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 35.
The spelling of 12462406253 in words is "twelve billion, four hundred sixty-two million, four hundred six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •