Base | Representation |
---|---|
bin | 10111010100100100… |
… | …11001111000001101 |
3 | 1012022120202210022210 |
4 | 23222102121320031 |
5 | 201120240041400 |
6 | 5430224301033 |
7 | 622162402554 |
oct | 135222317015 |
9 | 35276683283 |
10 | 12520627725 |
11 | 5345627a21 |
12 | 2515171779 |
13 | 1246c8c978 |
14 | 86ac22d9b |
15 | 4d4310950 |
hex | 2ea499e0d |
12520627725 has 24 divisors (see below), whose sum is σ = 20725548480. Its totient is φ = 6669675520.
The previous prime is 12520627681. The next prime is 12520627781. The reversal of 12520627725 is 52772602521.
12520627725 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12520627725 - 29 = 12520627213 is a prime.
It is a super-2 number, since 2×125206277252 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36564 + ... + 162413.
It is an arithmetic number, because the mean of its divisors is an integer number (863564520).
Almost surely, 212520627725 is an apocalyptic number.
12520627725 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12520627725 is a deficient number, since it is larger than the sum of its proper divisors (8204920755).
12520627725 is a wasteful number, since it uses less digits than its factorization.
12520627725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199829 (or 199824 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 39.
The spelling of 12520627725 in words is "twelve billion, five hundred twenty million, six hundred twenty-seven thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •