Base | Representation |
---|---|
bin | 11000011101111001001001… |
… | …11011010111001011111111 |
3 | 21001111120200121110102101022 |
4 | 30032330210323113023333 |
5 | 24023004411230430424 |
6 | 310233022250134355 |
7 | 14222121135311525 |
oct | 1416744473271377 |
9 | 231446617412338 |
10 | 53803674858239 |
11 | 16164012886989 |
12 | 604b619a213bb |
13 | 240388465c577 |
14 | d4017c940315 |
15 | 6348550e295e |
hex | 30ef24ed72ff |
53803674858239 has 16 divisors (see below), whose sum is σ = 56440782488448. Its totient is φ = 51229114394112.
The previous prime is 53803674858229. The next prime is 53803674858289. The reversal of 53803674858239 is 93285847630835.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53803674858239 is a prime.
It is a super-2 number, since 2×538036748582392 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53803674858229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11566949 + ... + 15537105.
It is an arithmetic number, because the mean of its divisors is an integer number (3527548905528).
Almost surely, 253803674858239 is an apocalyptic number.
53803674858239 is a deficient number, since it is larger than the sum of its proper divisors (2637107630209).
53803674858239 is a wasteful number, since it uses less digits than its factorization.
53803674858239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3978034.
The product of its (nonzero) digits is 1045094400, while the sum is 71.
The spelling of 53803674858239 in words is "fifty-three trillion, eight hundred three billion, six hundred seventy-four million, eight hundred fifty-eight thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •