Base | Representation |
---|---|
bin | 10111010101000001… |
… | …11100101001000111 |
3 | 1012022211221110222011 |
4 | 23222200330221013 |
5 | 201122224041020 |
6 | 5430442115051 |
7 | 622236661504 |
oct | 135240745107 |
9 | 35284843864 |
10 | 12524440135 |
11 | 53477a1279 |
12 | 25164aba87 |
13 | 12479c602c |
14 | 86b5364ab |
15 | 4d481535a |
hex | 2ea83ca47 |
12524440135 has 8 divisors (see below), whose sum is σ = 15108016896. Its totient is φ = 9967092960.
The previous prime is 12524440087. The next prime is 12524440157. The reversal of 12524440135 is 53104442521.
12524440135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12524440135 - 233 = 3934505543 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12524440097 and 12524440106.
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 7 ways as a sum of consecutive naturals, for example, 6556344 + ... + 6558253.
It is an arithmetic number, because the mean of its divisors is an integer number (1888502112).
Almost surely, 212524440135 is an apocalyptic number.
12524440135 is a deficient number, since it is larger than the sum of its proper divisors (2583576761).
12524440135 is a wasteful number, since it uses less digits than its factorization.
12524440135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13114793.
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 12524440135 its reverse (53104442521), we get a palindrome (65628882656).
The spelling of 12524440135 in words is "twelve billion, five hundred twenty-four million, four hundred forty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •