Base | Representation |
---|---|
bin | 101000101111110000001… |
… | …0011100101001011110111 |
3 | 201211100211222201000222112 |
4 | 1101133200103211023313 |
5 | 1213223004014203434 |
6 | 15524353014321235 |
7 | 1115410560222650 |
oct | 121374023451367 |
9 | 21740758630875 |
10 | 5600105616119 |
11 | 1869a9a698003 |
12 | 76540805921b |
13 | 31811a880601 |
14 | 155091a80527 |
15 | 9aa119a2dce |
hex | 517e04e52f7 |
5600105616119 has 16 divisors (see below), whose sum is σ = 6733031731200. Its totient is φ = 4556018118624.
The previous prime is 5600105616103. The next prime is 5600105616179. The reversal of 5600105616119 is 9116165010065.
It is not a de Polignac number, because 5600105616119 - 24 = 5600105616103 is a prime.
It is a super-2 number, since 2×56001056161192 (a number of 26 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 (5600105616179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 233773847 + ... + 233797800.
It is an arithmetic number, because the mean of its divisors is an integer number (420814483200).
Almost surely, 25600105616119 is an apocalyptic number.
5600105616119 is a gapful number since it is divisible by the number (59) formed by its first and last digit.
5600105616119 is a deficient number, since it is larger than the sum of its proper divisors (1132926115081).
5600105616119 is a wasteful number, since it uses less digits than its factorization.
5600105616119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467571742.
The product of its (nonzero) digits is 48600, while the sum is 41.
The spelling of 5600105616119 in words is "five trillion, six hundred billion, one hundred five million, six hundred sixteen thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •