Base | Representation |
---|---|
bin | 111100011000100… |
… | …000010101010101 |
3 | 2121121020121202012 |
4 | 330120200111111 |
5 | 4033320304403 |
6 | 244305154005 |
7 | 34050561344 |
oct | 7430402525 |
9 | 2547217665 |
10 | 1013056853 |
11 | 47a931676 |
12 | 24332b905 |
13 | 131b5c233 |
14 | 98789b5b |
15 | 5de0eed8 |
hex | 3c620555 |
1013056853 has 2 divisors, whose sum is σ = 1013056854. Its totient is φ = 1013056852.
The previous prime is 1013056813. The next prime is 1013056859. The reversal of 1013056853 is 3586503101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 668843044 + 344213809 = 25862^2 + 18553^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013056853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013056859) 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, 506528426 + 506528427.
It is an arithmetic number, because the mean of its divisors is an integer number (506528427).
Almost surely, 21013056853 is an apocalyptic number.
It is an amenable number.
1013056853 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013056853 is an equidigital number, since it uses as much as digits as its factorization.
1013056853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 32.
The square root of 1013056853 is about 31828.5540513546. The cubic root of 1013056853 is about 1004.3334781741. Note that the first 3 decimals are identical.
Adding to 1013056853 its reverse (3586503101), we get a palindrome (4599559954).
The spelling of 1013056853 in words is "one billion, thirteen million, fifty-six thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •