Base | Representation |
---|---|
bin | 101000110010100000001… |
… | …0011001101101110011001 |
3 | 201211221002112220200222212 |
4 | 1101211000103031232121 |
5 | 1213322102320200212 |
6 | 15531211013324505 |
7 | 1116010116056204 |
oct | 121450023155631 |
9 | 21757075820885 |
10 | 5606011100057 |
11 | 1871550132545 |
12 | 766595936735 |
13 | 31884c1a59c4 |
14 | 1554920c893b |
15 | 9ac5a16ae22 |
hex | 519404cdb99 |
5606011100057 has 4 divisors (see below), whose sum is σ = 5608583847120. Its totient is φ = 5603438352996.
The previous prime is 5606011099979. The next prime is 5606011100069. The reversal of 5606011100057 is 7500011106065.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5606011100057 - 218 = 5606010837913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5606011099996 and 5606011100032.
It is not an unprimeable number, because it can be changed into a prime (5606011109057) 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 3 ways as a sum of consecutive naturals, for example, 1286370263 + ... + 1286374620.
It is an arithmetic number, because the mean of its divisors is an integer number (1402145961780).
Almost surely, 25606011100057 is an apocalyptic number.
It is an amenable number.
5606011100057 is a deficient number, since it is larger than the sum of its proper divisors (2572747063).
5606011100057 is a wasteful number, since it uses less digits than its factorization.
5606011100057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2572747062.
The product of its (nonzero) digits is 6300, while the sum is 32.
The spelling of 5606011100057 in words is "five trillion, six hundred six billion, eleven million, one hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •