Base | Representation |
---|---|
bin | 11011000010111111… |
… | …00100001011100001 |
3 | 1101110222000012120011 |
4 | 31201133210023201 |
5 | 214214231111442 |
6 | 10400510044521 |
7 | 1022555531053 |
oct | 154137441341 |
9 | 41428005504 |
10 | 14520566497 |
11 | 6181532588 |
12 | 2992aa9741 |
13 | 14a54151a8 |
14 | 9ba6a38d3 |
15 | 59ebb0117 |
hex | 3617e42e1 |
14520566497 has 2 divisors, whose sum is σ = 14520566498. Its totient is φ = 14520566496.
The previous prime is 14520566483. The next prime is 14520566513. The reversal of 14520566497 is 79466502541.
14520566497 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14487492496 + 33074001 = 120364^2 + 5751^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14520566497 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14520566497.
It is not a weakly prime, because it can be changed into another prime (14520566477) 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, 7260283248 + 7260283249.
It is an arithmetic number, because the mean of its divisors is an integer number (7260283249).
Almost surely, 214520566497 is an apocalyptic number.
It is an amenable number.
14520566497 is a deficient number, since it is larger than the sum of its proper divisors (1).
14520566497 is an equidigital number, since it uses as much as digits as its factorization.
14520566497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 49.
The spelling of 14520566497 in words is "fourteen billion, five hundred twenty million, five hundred sixty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •