Base | Representation |
---|---|
bin | 1011100100111000110110… |
… | …0101111101101101000001 |
3 | 1200001211010112202120122112 |
4 | 2321032031211331231001 |
5 | 3132020142042400234 |
6 | 43023155102345105 |
7 | 2452410500536646 |
oct | 271161545755501 |
9 | 50054115676575 |
10 | 12728363637569 |
11 | 406808349a188 |
12 | 1516a1328b195 |
13 | 7143831c6c08 |
14 | 3200adc8ddcd |
15 | 17116211dace |
hex | b938d97db41 |
12728363637569 has 2 divisors, whose sum is σ = 12728363637570. Its totient is φ = 12728363637568.
The previous prime is 12728363637511. The next prime is 12728363637589. The reversal of 12728363637569 is 96573636382721.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7344571547569 + 5383792090000 = 2710087^2 + 2320300^2 .
It is a cyclic number.
It is not a de Polignac number, because 12728363637569 - 232 = 12724068670273 is a prime.
It is a super-2 number, since 2×127283636375692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12728363637499 and 12728363637508.
It is not a weakly prime, because it can be changed into another prime (12728363637589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6364181818784 + 6364181818785.
It is an arithmetic number, because the mean of its divisors is an integer number (6364181818785).
Almost surely, 212728363637569 is an apocalyptic number.
It is an amenable number.
12728363637569 is a deficient number, since it is larger than the sum of its proper divisors (1).
12728363637569 is an equidigital number, since it uses as much as digits as its factorization.
12728363637569 is an evil number, because the sum of its binary digits is even.
The product of its digits is 411505920, while the sum is 68.
The spelling of 12728363637569 in words is "twelve trillion, seven hundred twenty-eight billion, three hundred sixty-three million, six hundred thirty-seven thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •