Base | Representation |
---|---|
bin | 101000110000001010110… |
… | …0111011001110110001000 |
3 | 201211110011022122200212122 |
4 | 1101200111213121312020 |
5 | 1213231322000130000 |
6 | 15525021444230412 |
7 | 1115442000341501 |
oct | 121402547316610 |
9 | 21743138580778 |
10 | 5601000005000 |
11 | 186a409537674 |
12 | 76561769b408 |
13 | 318230c60cba |
14 | 155138779ba8 |
15 | 9aa65272085 |
hex | 518159d9d88 |
5601000005000 has 80 divisors (see below), whose sum is σ = 13319011614480. Its totient is φ = 2206961064000.
The previous prime is 5601000004997. The next prime is 5601000005059. The reversal of 5601000005000 is 5000001065.
It is a self number, because there is not a number n which added to its sum of digits gives 5601000005000.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 8024702 + ... + 8694701.
It is an arithmetic number, because the mean of its divisors is an integer number (166487645181).
Almost surely, 25601000005000 is an apocalyptic number.
5601000005000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5601000005000 is an abundant number, since it is smaller than the sum of its proper divisors (7718011609480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5601000005000 is a wasteful number, since it uses less digits than its factorization.
5601000005000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16719496 (or 16719477 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 17.
Adding to 5601000005000 its reverse (5000001065), we get a palindrome (5606000006065).
The spelling of 5601000005000 in words is "five trillion, six hundred one billion, five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •