Base | Representation |
---|---|
bin | 101011101010001111111… |
… | …1111010101101011111001 |
3 | 210020122121112212001110221 |
4 | 1113110133333111223321 |
5 | 1241303220114310410 |
6 | 20432350151540041 |
7 | 1156346416341400 |
oct | 127243777255371 |
9 | 23218545761427 |
10 | 6000606010105 |
11 | 1a0392a725853 |
12 | 80ab5a98a621 |
13 | 346b15a81165 |
14 | 16a60649c637 |
15 | a61522914da |
hex | 5751ffd5af9 |
6000606010105 has 24 divisors (see below), whose sum is σ = 8377080174792. Its totient is φ = 4114345600512.
The previous prime is 6000606010043. The next prime is 6000606010121. The reversal of 6000606010105 is 5010106060006.
It can be written as a sum of positive squares in 4 ways, for example, as 16339741929 + 5984266268176 = 127827^2 + 2446276^2 .
It is not a de Polignac number, because 6000606010105 - 223 = 6000597621497 is a prime.
It is a super-2 number, since 2×60006060101052 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6000606010105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1797379 + ... + 3902791.
It is an arithmetic number, because the mean of its divisors is an integer number (349045007283).
Almost surely, 26000606010105 is an apocalyptic number.
It is an amenable number.
6000606010105 is a deficient number, since it is larger than the sum of its proper divisors (2376474164687).
6000606010105 is a wasteful number, since it uses less digits than its factorization.
6000606010105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2117065 (or 2117058 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
The spelling of 6000606010105 in words is "six trillion, six hundred six million, ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •