Base | Representation |
---|---|
bin | 101000110000100110000… |
… | …0011011010011100010010 |
3 | 201211112111222012202121010 |
4 | 1101201030003122130102 |
5 | 1213240204302122023 |
6 | 15525252231511350 |
7 | 1115503430353215 |
oct | 121411403323422 |
9 | 21745458182533 |
10 | 5601913317138 |
11 | 186a838031596 |
12 | 765831528556 |
13 | 318348238998 |
14 | 1551c3b9d77c |
15 | 9aaba52d093 |
hex | 5184c0da712 |
5601913317138 has 32 divisors (see below), whose sum is σ = 11566293442560. Its totient is φ = 1806904273680.
The previous prime is 5601913317137. The next prime is 5601913317139. The reversal of 5601913317138 is 8317133191065.
It is an interprime number because it is at equal distance from previous prime (5601913317137) and next prime (5601913317139).
It is a super-2 number, since 2×56019133171382 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5601913317137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 685383 + ... + 3416661.
It is an arithmetic number, because the mean of its divisors is an integer number (361446670080).
Almost surely, 25601913317138 is an apocalyptic number.
5601913317138 is an abundant number, since it is smaller than the sum of its proper divisors (5964380125422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5601913317138 is a wasteful number, since it uses less digits than its factorization.
5601913317138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2742342.
The product of its (nonzero) digits is 408240, while the sum is 48.
The spelling of 5601913317138 in words is "five trillion, six hundred one billion, nine hundred thirteen million, three hundred seventeen thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •