Base | Representation |
---|---|
bin | 10111010101101111… |
… | …01111000001100001 |
3 | 1012100021011222010000 |
4 | 23222313233001201 |
5 | 201130241214130 |
6 | 5431214130213 |
7 | 622341521160 |
oct | 135267570141 |
9 | 35307158100 |
10 | 12530413665 |
11 | 5350101280 |
12 | 25184b0969 |
13 | 1249007c73 |
14 | 86c24d3d7 |
15 | 4d50e5260 |
hex | 2eadef061 |
12530413665 has 80 divisors (see below), whose sum is σ = 28004549760. Its totient is φ = 5207431680.
The previous prime is 12530413627. The next prime is 12530413691. The reversal of 12530413665 is 56631403521.
12530413665 is a `hidden beast` number, since 1 + 253 + 0 + 41 + 366 + 5 = 666.
It is not a de Polignac number, because 12530413665 - 211 = 12530411617 is a prime.
It is a super-2 number, since 2×125304136652 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
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 79 ways as a sum of consecutive naturals, for example, 169720 + ... + 232089.
It is an arithmetic number, because the mean of its divisors is an integer number (350056872).
Almost surely, 212530413665 is an apocalyptic number.
12530413665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12530413665 is an abundant number, since it is smaller than the sum of its proper divisors (15474136095).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12530413665 is a wasteful number, since it uses less digits than its factorization.
12530413665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401844 (or 401835 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 12530413665 in words is "twelve billion, five hundred thirty million, four hundred thirteen thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •