Base | Representation |
---|---|
bin | 110001010111110111… |
… | …000100001001011011 |
3 | 12001211121112222022012 |
4 | 301113313010021123 |
5 | 1332032444112001 |
6 | 40204254420135 |
7 | 3554504451146 |
oct | 612767041133 |
9 | 161747488265 |
10 | 53013660251 |
11 | 20534913662 |
12 | a33620164b |
13 | 4ccb227b46 |
14 | 27cca9105d |
15 | 15a42362bb |
hex | c57dc425b |
53013660251 has 8 divisors (see below), whose sum is σ = 56187540864. Its totient is φ = 49845938560.
The previous prime is 53013660247. The next prime is 53013660257. The reversal of 53013660251 is 15206631035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53013660251 - 22 = 53013660247 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53013660257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1521995 + ... + 1556436.
It is an arithmetic number, because the mean of its divisors is an integer number (7023442608).
Almost surely, 253013660251 is an apocalyptic number.
53013660251 is a deficient number, since it is larger than the sum of its proper divisors (3173880613).
53013660251 is a wasteful number, since it uses less digits than its factorization.
53013660251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3079461.
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 53013660251 in words is "fifty-three billion, thirteen million, six hundred sixty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •