Base | Representation |
---|---|
bin | 101100001010111000111… |
… | …111010000001011010101 |
3 | 101202011202210110202001212 |
4 | 230022320333100023111 |
5 | 344212344212000203 |
6 | 10242230515231205 |
7 | 432203546356334 |
oct | 54127077201325 |
9 | 11664683422055 |
10 | 3035350500053 |
11 | a70315253683 |
12 | 4103308a8505 |
13 | 190303553561 |
14 | a6ca9b9dd1b |
15 | 53e52e5b1d8 |
hex | 2c2b8fd02d5 |
3035350500053 has 2 divisors, whose sum is σ = 3035350500054. Its totient is φ = 3035350500052.
The previous prime is 3035350500041. The next prime is 3035350500097. The reversal of 3035350500053 is 3500050535303.
3035350500053 is digitally balanced in base 2 and base 3, because in such bases 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., 2846110709764 + 189239790289 = 1687042^2 + 435017^2 .
It is a cyclic number.
It is not a de Polignac number, because 3035350500053 - 210 = 3035350499029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3035350499992 and 3035350500019.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3035350502053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1517675250026 + 1517675250027.
It is an arithmetic number, because the mean of its divisors is an integer number (1517675250027).
Almost surely, 23035350500053 is an apocalyptic number.
It is an amenable number.
3035350500053 is a deficient number, since it is larger than the sum of its proper divisors (1).
3035350500053 is an equidigital number, since it uses as much as digits as its factorization.
3035350500053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50625, while the sum is 32.
The spelling of 3035350500053 in words is "three trillion, thirty-five billion, three hundred fifty million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •