Base | Representation |
---|---|
bin | 1011001011111010… |
… | …10111111101101011 |
3 | 120111112111210202212 |
4 | 11211331113331223 |
5 | 44244410230201 |
6 | 2431531515335 |
7 | 301552242566 |
oct | 54575277553 |
9 | 16445453685 |
10 | 6005555051 |
11 | 2601a85441 |
12 | 11b72b8b4b |
13 | 749292392 |
14 | 40d8574dd |
15 | 252383abb |
hex | 165f57f6b |
6005555051 has 8 divisors (see below), whose sum is σ = 6047944224. Its totient is φ = 5963218560.
The previous prime is 6005555033. The next prime is 6005555077. The reversal of 6005555051 is 1505555006.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6005555051 is a prime.
It is a super-2 number, since 2×60055550512 = 72133382941183225202, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6005554999 and 6005555017.
It is not an unprimeable number, because it can be changed into a prime (6005555651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 231506 + ... + 256136.
It is an arithmetic number, because the mean of its divisors is an integer number (755993028).
Almost surely, 26005555051 is an apocalyptic number.
6005555051 is a deficient number, since it is larger than the sum of its proper divisors (42389173).
6005555051 is a wasteful number, since it uses less digits than its factorization.
6005555051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26341.
The product of its (nonzero) digits is 18750, while the sum is 32.
The square root of 6005555051 is about 77495.5163283657. The cubic root of 6005555051 is about 1817.6812086076.
The spelling of 6005555051 in words is "six billion, five million, five hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •