Base | Representation |
---|---|
bin | 1011001011110111… |
… | …10101001110101000 |
3 | 120111111202021000101 |
4 | 11211323311032220 |
5 | 44244304310012 |
6 | 2431515115144 |
7 | 301545636535 |
oct | 54573651650 |
9 | 16444667011 |
10 | 6005150632 |
11 | 2601829608 |
12 | 11b7142ab4 |
13 | 749180290 |
14 | 40d78dd8c |
15 | 252303d57 |
hex | 165ef53a8 |
6005150632 has 16 divisors (see below), whose sum is σ = 12125785140. Its totient is φ = 2771607936.
The previous prime is 6005150629. The next prime is 6005150651. The reversal of 6005150632 is 2360515006.
It can be written as a sum of positive squares in 2 ways, for example, as 5989831236 + 15319396 = 77394^2 + 3914^2 .
It is a super-2 number, since 2×60051506322 = 72123668226019998848, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6005150632.
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 3 ways as a sum of consecutive naturals, for example, 28870813 + ... + 28871020.
Almost surely, 26005150632 is an apocalyptic number.
It is an amenable number.
6005150632 is an abundant number, since it is smaller than the sum of its proper divisors (6120634508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6005150632 is a wasteful number, since it uses less digits than its factorization.
6005150632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57741852 (or 57741848 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 6005150632 is about 77492.9069786390. The cubic root of 6005150632 is about 1817.6404063108.
Adding to 6005150632 its reverse (2360515006), we get a palindrome (8365665638).
The spelling of 6005150632 in words is "six billion, five million, one hundred fifty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •