Base | Representation |
---|---|
bin | 1000011011100111… |
… | …11111011000010101 |
3 | 102200110210012002112 |
4 | 10031303333120111 |
5 | 33232313400203 |
6 | 2025102520405 |
7 | 220114213151 |
oct | 41563773025 |
9 | 12613705075 |
10 | 4526700053 |
11 | 1a13227827 |
12 | a63b96105 |
13 | 571a94755 |
14 | 30d29a061 |
15 | 1b76146d8 |
hex | 10dcff615 |
4526700053 has 2 divisors, whose sum is σ = 4526700054. Its totient is φ = 4526700052.
The previous prime is 4526700023. The next prime is 4526700107. The reversal of 4526700053 is 3500076254.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3297286084 + 1229413969 = 57422^2 + 35063^2 .
It is a cyclic number.
It is not a de Polignac number, because 4526700053 - 28 = 4526699797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4526699992 and 4526700019.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4526700023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2263350026 + 2263350027.
It is an arithmetic number, because the mean of its divisors is an integer number (2263350027).
Almost surely, 24526700053 is an apocalyptic number.
It is an amenable number.
4526700053 is a deficient number, since it is larger than the sum of its proper divisors (1).
4526700053 is an equidigital number, since it uses as much as digits as its factorization.
4526700053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 32.
The square root of 4526700053 is about 67280.7554431429. The cubic root of 4526700053 is about 1654.2224333576. Note that the first 3 decimals are identical.
The spelling of 4526700053 in words is "four billion, five hundred twenty-six million, seven hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •