Base | Representation |
---|---|
bin | 101000110000001101110… |
… | …0110110010000111100100 |
3 | 201211110102022202122202001 |
4 | 1101200123212302013210 |
5 | 1213232023212134242 |
6 | 15525035434255044 |
7 | 1115444330520205 |
oct | 121403346620744 |
9 | 21743368678661 |
10 | 5601100505572 |
11 | 186a4602401a0 |
12 | 765645287484 |
13 | 318248a1b5b0 |
14 | 155147c5b5ac |
15 | 9aa6dec4eb7 |
hex | 5181b9b21e4 |
5601100505572 has 24 divisors (see below), whose sum is σ = 11515549292352. Its totient is φ = 2350112100000.
The previous prime is 5601100505527. The next prime is 5601100505647. The reversal of 5601100505572 is 2755050011065.
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 7 ways as a sum of consecutive naturals, for example, 4896066304 + ... + 4896067447.
It is an arithmetic number, because the mean of its divisors is an integer number (479814553848).
Almost surely, 25601100505572 is an apocalyptic number.
5601100505572 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5601100505572 is an abundant number, since it is smaller than the sum of its proper divisors (5914448786780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5601100505572 is a wasteful number, since it uses less digits than its factorization.
5601100505572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9792133779 (or 9792133777 counting only the distinct ones).
The product of its (nonzero) digits is 52500, while the sum is 37.
The spelling of 5601100505572 in words is "five trillion, six hundred one billion, one hundred million, five hundred five thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •