Base | Representation |
---|---|
bin | 1011001100100001… |
… | …00111101001111100 |
3 | 120111220000010020001 |
4 | 11212100213221330 |
5 | 44302203200220 |
6 | 2432232004044 |
7 | 301643154223 |
oct | 54620475174 |
9 | 16456003201 |
10 | 6010600060 |
11 | 2604910873 |
12 | 11b8b30624 |
13 | 74a33a7aa |
14 | 4103abcba |
15 | 252a2d80a |
hex | 166427a7c |
6010600060 has 12 divisors (see below), whose sum is σ = 12622260168. Its totient is φ = 2404240016.
The previous prime is 6010600027. The next prime is 6010600067. The reversal of 6010600060 is 600060106.
It is a happy number.
It is a super-2 number, since 2×60106000602 = 72254626162544007200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6010600067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 150264982 + ... + 150265021.
It is an arithmetic number, because the mean of its divisors is an integer number (1051855014).
Almost surely, 26010600060 is an apocalyptic number.
It is an amenable number.
6010600060 is an abundant number, since it is smaller than the sum of its proper divisors (6611660108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6010600060 is a wasteful number, since it uses less digits than its factorization.
6010600060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300530012 (or 300530010 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 6010600060 is about 77528.0598235245. The cubic root of 6010600060 is about 1818.1900514673.
Adding to 6010600060 its reverse (600060106), we get a palindrome (6610660166).
The spelling of 6010600060 in words is "six billion, ten million, six hundred thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •