Base | Representation |
---|---|
bin | 110001011010000011… |
… | …001111000010101011 |
3 | 12001221011200210200010 |
4 | 301122003033002223 |
5 | 1332121400430120 |
6 | 40212050143003 |
7 | 3555432000615 |
oct | 613203170253 |
9 | 161834623603 |
10 | 53050405035 |
11 | 20553630551 |
12 | a346581a63 |
13 | 5005a21b14 |
14 | 27d38d7db5 |
15 | 15a75937e0 |
hex | c5a0cf0ab |
53050405035 has 32 divisors (see below), whose sum is σ = 85762732608. Its totient is φ = 27999795200.
The previous prime is 53050404991. The next prime is 53050405049.
53050405035 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 53050405035 - 27 = 53050404907 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53050404993 and 53050405011.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 3618079 + ... + 3632711.
It is an arithmetic number, because the mean of its divisors is an integer number (2680085394).
Almost surely, 253050405035 is an apocalyptic number.
53050405035 is a deficient number, since it is larger than the sum of its proper divisors (32712327573).
53050405035 is a wasteful number, since it uses less digits than its factorization.
53050405035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17135.
The product of its (nonzero) digits is 22500, while the sum is 30.
The spelling of 53050405035 in words is "fifty-three billion, fifty million, four hundred five thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •