Base | Representation |
---|---|
bin | 10111101000101100… |
… | …11111101000101001 |
3 | 1012202100110222011222 |
4 | 23310112133220221 |
5 | 201442001101131 |
6 | 5455055231425 |
7 | 626312506211 |
oct | 136426375051 |
9 | 35670428158 |
10 | 12689472041 |
11 | 5421970184 |
12 | 2561818575 |
13 | 1272c58c4c |
14 | 885415241 |
15 | 4e406387b |
hex | 2f459fa29 |
12689472041 has 2 divisors, whose sum is σ = 12689472042. Its totient is φ = 12689472040.
The previous prime is 12689472007. The next prime is 12689472067. The reversal of 12689472041 is 14027498621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7119984400 + 5569487641 = 84380^2 + 74629^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12689472041 is a prime.
It is a super-2 number, since 2×126894720412 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12689471983 and 12689472001.
It is not a weakly prime, because it can be changed into another prime (12689472001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6344736020 + 6344736021.
It is an arithmetic number, because the mean of its divisors is an integer number (6344736021).
Almost surely, 212689472041 is an apocalyptic number.
It is an amenable number.
12689472041 is a deficient number, since it is larger than the sum of its proper divisors (1).
12689472041 is an equidigital number, since it uses as much as digits as its factorization.
12689472041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 193536, while the sum is 44.
The spelling of 12689472041 in words is "twelve billion, six hundred eighty-nine million, four hundred seventy-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •