Base | Representation |
---|---|
bin | 1000101011011001… |
… | …10001110001101101 |
3 | 110000200210002121112 |
4 | 10111230301301231 |
5 | 34020202331203 |
6 | 2050151041405 |
7 | 223312035152 |
oct | 42554616155 |
9 | 13020702545 |
10 | 4659027053 |
11 | 1a80998a8a |
12 | aa0370265 |
13 | 593316455 |
14 | 322aa4229 |
15 | 1c40526d8 |
hex | 115b31c6d |
4659027053 has 2 divisors, whose sum is σ = 4659027054. Its totient is φ = 4659027052.
The previous prime is 4659027047. The next prime is 4659027127. The reversal of 4659027053 is 3507209564.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2924970889 + 1734056164 = 54083^2 + 41642^2 .
It is a cyclic number.
It is not a de Polignac number, because 4659027053 - 26 = 4659026989 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4659027053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4659027553) 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, 2329513526 + 2329513527.
It is an arithmetic number, because the mean of its divisors is an integer number (2329513527).
Almost surely, 24659027053 is an apocalyptic number.
It is an amenable number.
4659027053 is a deficient number, since it is larger than the sum of its proper divisors (1).
4659027053 is an equidigital number, since it uses as much as digits as its factorization.
4659027053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 226800, while the sum is 41.
The square root of 4659027053 is about 68257.0659565733. The cubic root of 4659027053 is about 1670.1869169391.
The spelling of 4659027053 in words is "four billion, six hundred fifty-nine million, twenty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •