Base | Representation |
---|---|
bin | 110001011000111010… |
… | …100101101000001011 |
3 | 12001212211212021012210 |
4 | 301120322211220023 |
5 | 1332102012023120 |
6 | 40210130040203 |
7 | 3555111063012 |
oct | 613072455013 |
9 | 161784767183 |
10 | 53031361035 |
11 | 20543903504 |
12 | a340119063 |
13 | 5001ab4893 |
14 | 27d117ba79 |
15 | 15a5a80ce0 |
hex | c58ea5a0b |
53031361035 has 16 divisors (see below), whose sum is σ = 89315976960. Its totient is φ = 26794792800.
The previous prime is 53031361013. The next prime is 53031361039. The reversal of 53031361035 is 53016313035.
It is not a de Polignac number, because 53031361035 - 25 = 53031361003 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53031360993 and 53031361011.
It is not an unprimeable number, because it can be changed into a prime (53031361039) 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 in 15 ways as a sum of consecutive naturals, for example, 93037191 + ... + 93037760.
It is an arithmetic number, because the mean of its divisors is an integer number (5582248560).
Almost surely, 253031361035 is an apocalyptic number.
53031361035 is a deficient number, since it is larger than the sum of its proper divisors (36284615925).
53031361035 is a wasteful number, since it uses less digits than its factorization.
53031361035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186074978.
The product of its (nonzero) digits is 12150, while the sum is 30.
The spelling of 53031361035 in words is "fifty-three billion, thirty-one million, three hundred sixty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •