Base | Representation |
---|---|
bin | 10111010010101100… |
… | …10010100001101101 |
3 | 1012021111010011101022 |
4 | 23221112102201231 |
5 | 201102221301343 |
6 | 5424502423525 |
7 | 621611426642 |
oct | 135126224155 |
9 | 35244104338 |
10 | 12504868973 |
11 | 5337744163 |
12 | 250ba31ba5 |
13 | 1243932b6c |
14 | 868abddc9 |
15 | 4d2c4b568 |
hex | 2e959286d |
12504868973 has 2 divisors, whose sum is σ = 12504868974. Its totient is φ = 12504868972.
The previous prime is 12504868921. The next prime is 12504869009. The reversal of 12504868973 is 37986840521.
12504868973 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12495215524 + 9653449 = 111782^2 + 3107^2 .
It is a cyclic number.
It is not a de Polignac number, because 12504868973 - 226 = 12437760109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12504868913) by changing a digit.
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 as a sum of consecutive naturals, namely, 6252434486 + 6252434487.
It is an arithmetic number, because the mean of its divisors is an integer number (6252434487).
It is a 1-persistent number, because it is pandigital, but 2⋅12504868973 = 25009737946 is not.
Almost surely, 212504868973 is an apocalyptic number.
It is an amenable number.
12504868973 is a deficient number, since it is larger than the sum of its proper divisors (1).
12504868973 is an equidigital number, since it uses as much as digits as its factorization.
12504868973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 12504868973 in words is "twelve billion, five hundred four million, eight hundred sixty-eight thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •