Base | Representation |
---|---|
bin | 11011000110110011… |
… | …00111001000000001 |
3 | 1101120012012122120111 |
4 | 31203121213020001 |
5 | 214300423411004 |
6 | 10404011511321 |
7 | 1023424502002 |
oct | 154331471001 |
9 | 41505178514 |
10 | 14552560129 |
11 | 61985a48a8 |
12 | 29a1758541 |
13 | 14abc37733 |
14 | 9c0a311a9 |
15 | 5a28cea04 |
hex | 363667201 |
14552560129 has 2 divisors, whose sum is σ = 14552560130. Its totient is φ = 14552560128.
The previous prime is 14552560081. The next prime is 14552560153. The reversal of 14552560129 is 92106525541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14056473600 + 496086529 = 118560^2 + 22273^2 .
It is a cyclic number.
It is not a de Polignac number, because 14552560129 - 227 = 14418342401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14552560091 and 14552560100.
It is not a weakly prime, because it can be changed into another prime (14552560159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7276280064 + 7276280065.
It is an arithmetic number, because the mean of its divisors is an integer number (7276280065).
Almost surely, 214552560129 is an apocalyptic number.
It is an amenable number.
14552560129 is a deficient number, since it is larger than the sum of its proper divisors (1).
14552560129 is an equidigital number, since it uses as much as digits as its factorization.
14552560129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 40.
The spelling of 14552560129 in words is "fourteen billion, five hundred fifty-two million, five hundred sixty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •