Base | Representation |
---|---|
bin | 1011011011011110… |
… | …00111111100100000 |
3 | 120211122000222120021 |
4 | 11231233013330200 |
5 | 100031311142102 |
6 | 2452512323224 |
7 | 305025312100 |
oct | 55557077440 |
9 | 16748028507 |
10 | 6136037152 |
11 | 26696a6593 |
12 | 1232b43514 |
13 | 76a31941b |
14 | 422d01200 |
15 | 25da5a137 |
hex | 16dbc7f20 |
6136037152 has 144 divisors (see below), whose sum is σ = 15171831360. Its totient is φ = 2428242432.
The previous prime is 6136037071. The next prime is 6136037207. The reversal of 6136037152 is 2517306316.
It is a super-2 number, since 2×61360371522 = 75301903861448542208, which contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 1042923 + ... + 1048789.
It is an arithmetic number, because the mean of its divisors is an integer number (105359940).
Almost surely, 26136037152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6136037152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7585915680).
6136037152 is an abundant number, since it is smaller than the sum of its proper divisors (9035794208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6136037152 is a wasteful number, since it uses less digits than its factorization.
6136037152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5943 (or 5928 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 34.
The square root of 6136037152 is about 78332.8612524782. The cubic root of 6136037152 is about 1830.7511972671.
The spelling of 6136037152 in words is "six billion, one hundred thirty-six million, thirty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •