Base | Representation |
---|---|
bin | 1011010111001111… |
… | …10001010101111100 |
3 | 120202011021022101101 |
4 | 11223213301111330 |
5 | 44443220231012 |
6 | 2445204022444 |
7 | 304114602010 |
oct | 55347612574 |
9 | 16664238341 |
10 | 6100555132 |
11 | 2650671401 |
12 | 1223091a24 |
13 | 762b75149 |
14 | 41c306540 |
15 | 25a89bd57 |
hex | 16b9f157c |
6100555132 has 24 divisors (see below), whose sum is σ = 12202968960. Its totient is φ = 2614125360.
The previous prime is 6100555117. The next prime is 6100555133. The reversal of 6100555132 is 2315550016.
It is a super-3 number, since 3×61005551323 (a number of 30 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 6100555132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6100555133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 240219 + ... + 264397.
It is an arithmetic number, because the mean of its divisors is an integer number (508457040).
Almost surely, 26100555132 is an apocalyptic number.
It is an amenable number.
6100555132 is an abundant number, since it is smaller than the sum of its proper divisors (6102413828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6100555132 is a wasteful number, since it uses less digits than its factorization.
6100555132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33201 (or 33199 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
The square root of 6100555132 is about 78106.0505466766. The cubic root of 6100555132 is about 1827.2155622347.
The spelling of 6100555132 in words is "six billion, one hundred million, five hundred fifty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •