Base | Representation |
---|---|
bin | 11000010000000001010110… |
… | …10011110010010010001111 |
3 | 20222211000102010221001011210 |
4 | 30020000223103302102033 |
5 | 23442202234340213002 |
6 | 305230034302545503 |
7 | 14142515530500414 |
oct | 1410005323622217 |
9 | 228730363831153 |
10 | 53327040554127 |
11 | 15a9a96418365a |
12 | 5b93179b98293 |
13 | 239a945291162 |
14 | d25084a0010b |
15 | 62725a95896c |
hex | 30802b4f248f |
53327040554127 has 8 divisors (see below), whose sum is σ = 71102756620720. Its totient is φ = 35551342428480.
The previous prime is 53327040554101. The next prime is 53327040554171. The reversal of 53327040554127 is 72145504072335.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53327040554127 - 222 = 53327036359823 is a prime.
It is a super-3 number, since 3×533270405541273 (a number of 42 digits) contains 333 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 (53327040554027) 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, 5857227 + ... + 11872707.
It is an arithmetic number, because the mean of its divisors is an integer number (8887844577590).
Almost surely, 253327040554127 is an apocalyptic number.
53327040554127 is a deficient number, since it is larger than the sum of its proper divisors (17775716066593).
53327040554127 is a wasteful number, since it uses less digits than its factorization.
53327040554127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8970473.
The product of its (nonzero) digits is 3528000, while the sum is 48.
The spelling of 53327040554127 in words is "fifty-three trillion, three hundred twenty-seven billion, forty million, five hundred fifty-four thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.319 sec. • engine limits •