Base | Representation |
---|---|
bin | 10111010100101011… |
… | …11011101001111001 |
3 | 1012022122111202212220 |
4 | 23222111323221321 |
5 | 201121004140010 |
6 | 5430300154253 |
7 | 622203303660 |
oct | 135225735171 |
9 | 35278452786 |
10 | 12521552505 |
11 | 53460a9800 |
12 | 2515538989 |
13 | 1247224887 |
14 | 86adc3dd7 |
15 | 4d4444970 |
hex | 2ea57ba79 |
12521552505 has 96 divisors (see below), whose sum is σ = 25237841664. Its totient is φ = 5189184000.
The previous prime is 12521552503. The next prime is 12521552507. The reversal of 12521552505 is 50525512521.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12521552503) and next prime (12521552507).
It is not a de Polignac number, because 12521552505 - 21 = 12521552503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (12521552503) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5347635 + ... + 5349975.
It is an arithmetic number, because the mean of its divisors is an integer number (262894184).
Almost surely, 212521552505 is an apocalyptic number.
12521552505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12521552505 is an abundant number, since it is smaller than the sum of its proper divisors (12716289159).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12521552505 is a wasteful number, since it uses less digits than its factorization.
12521552505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2799 (or 2788 counting only the distinct ones).
The product of its (nonzero) digits is 25000, while the sum is 33.
The spelling of 12521552505 in words is "twelve billion, five hundred twenty-one million, five hundred fifty-two thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •