Base | Representation |
---|---|
bin | 11011001000010101… |
… | …10011101010101001 |
3 | 1101121002110212010211 |
4 | 31210022303222221 |
5 | 214312224102203 |
6 | 10405152141121 |
7 | 1023642223624 |
oct | 154412635251 |
9 | 41532425124 |
10 | 14565456553 |
11 | 61a49030aa |
12 | 29a5b377a1 |
13 | 14b180175b |
14 | 9c262adbb |
15 | 5a3acac6d |
hex | 3642b3aa9 |
14565456553 has 2 divisors, whose sum is σ = 14565456554. Its totient is φ = 14565456552.
The previous prime is 14565456511. The next prime is 14565456569. The reversal of 14565456553 is 35565456541.
It is a happy number.
14565456553 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., 14265196969 + 300259584 = 119437^2 + 17328^2 .
It is a cyclic number.
It is not a de Polignac number, because 14565456553 - 221 = 14563359401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14565456497 and 14565456506.
It is not a weakly prime, because it can be changed into another prime (14565456053) 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, 7282728276 + 7282728277.
It is an arithmetic number, because the mean of its divisors is an integer number (7282728277).
Almost surely, 214565456553 is an apocalyptic number.
It is an amenable number.
14565456553 is a deficient number, since it is larger than the sum of its proper divisors (1).
14565456553 is an equidigital number, since it uses as much as digits as its factorization.
14565456553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5400000, while the sum is 49.
The spelling of 14565456553 in words is "fourteen billion, five hundred sixty-five million, four hundred fifty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •