Base | Representation |
---|---|
bin | 1011010111101011110001… |
… | …0111001000111110110101 |
3 | 1122021010121002001111122011 |
4 | 2311322330113020332311 |
5 | 3114311100320422234 |
6 | 42331041113204221 |
7 | 2430130124211454 |
oct | 265727427107665 |
9 | 48233532044564 |
10 | 12501515014069 |
11 | 3a8a954347844 |
12 | 149aa64100671 |
13 | 6c8b70688793 |
14 | 3131100d2b9b |
15 | 16a2d6a66b64 |
hex | b5ebc5c8fb5 |
12501515014069 has 2 divisors, whose sum is σ = 12501515014070. Its totient is φ = 12501515014068.
The previous prime is 12501515013983. The next prime is 12501515014111. The reversal of 12501515014069 is 96041051510521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8837908471044 + 3663606543025 = 2972862^2 + 1914055^2 .
It is a cyclic number.
It is not a de Polignac number, because 12501515014069 - 221 = 12501512916917 is a prime.
It is a super-2 number, since 2×125015150140692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12501515014369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6250757507034 + 6250757507035.
It is an arithmetic number, because the mean of its divisors is an integer number (6250757507035).
Almost surely, 212501515014069 is an apocalyptic number.
It is an amenable number.
12501515014069 is a deficient number, since it is larger than the sum of its proper divisors (1).
12501515014069 is an equidigital number, since it uses as much as digits as its factorization.
12501515014069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 40.
The spelling of 12501515014069 in words is "twelve trillion, five hundred one billion, five hundred fifteen million, fourteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •