Base | Representation |
---|---|
bin | 1000101001110100… |
… | …01010100001010001 |
3 | 102222202211000100021 |
4 | 10110322022201101 |
5 | 34003303242212 |
6 | 2044554423441 |
7 | 223061205022 |
oct | 42472124121 |
9 | 12882730307 |
10 | 4645759057 |
11 | 1a744565a5 |
12 | a97a31b81 |
13 | 59064c274 |
14 | 32100cc49 |
15 | 1c2cd1307 |
hex | 114e8a851 |
4645759057 has 2 divisors, whose sum is σ = 4645759058. Its totient is φ = 4645759056.
The previous prime is 4645759051. The next prime is 4645759091. The reversal of 4645759057 is 7509575464.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4640879376 + 4879681 = 68124^2 + 2209^2 .
It is a cyclic number.
It is not a de Polignac number, because 4645759057 - 227 = 4511541329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4645758995 and 4645759013.
It is not a weakly prime, because it can be changed into another prime (4645759051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2322879528 + 2322879529.
It is an arithmetic number, because the mean of its divisors is an integer number (2322879529).
Almost surely, 24645759057 is an apocalyptic number.
It is an amenable number.
4645759057 is a deficient number, since it is larger than the sum of its proper divisors (1).
4645759057 is an equidigital number, since it uses as much as digits as its factorization.
4645759057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292000, while the sum is 52.
The square root of 4645759057 is about 68159.8052887477. The cubic root of 4645759057 is about 1668.5999545228.
The spelling of 4645759057 in words is "four billion, six hundred forty-five million, seven hundred fifty-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •