Base | Representation |
---|---|
bin | 110001010111101100… |
… | …111101010111011011 |
3 | 12001211102120101021002 |
4 | 301113230331113123 |
5 | 1332031304323120 |
6 | 40204121535215 |
7 | 3554443105403 |
oct | 612754752733 |
9 | 161742511232 |
10 | 53011011035 |
11 | 20533374224 |
12 | a33534450b |
13 | 4cca80b068 |
14 | 27cc5a1803 |
15 | 15a3db1375 |
hex | c57b3d5db |
53011011035 has 16 divisors (see below), whose sum is σ = 63849885120. Its totient is φ = 42251289600.
The previous prime is 53011010989. The next prime is 53011011113.
53011011035 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 53011011035 - 28 = 53011010779 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53011010998 and 53011011016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1666439 + ... + 1697951.
It is an arithmetic number, because the mean of its divisors is an integer number (3990617820).
Almost surely, 253011011035 is an apocalyptic number.
53011011035 is a deficient number, since it is larger than the sum of its proper divisors (10838874085).
53011011035 is a wasteful number, since it uses less digits than its factorization.
53011011035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32758.
The product of its (nonzero) digits is 225, while the sum is 20.
It can be divided in two parts, 530110 and 11035, that added together give a palindrome (541145).
The spelling of 53011011035 in words is "fifty-three billion, eleven million, eleven thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •