Base | Representation |
---|---|
bin | 1011001011110110… |
… | …11101111001111101 |
3 | 120111111120101222012 |
4 | 11211323131321331 |
5 | 44244243230401 |
6 | 2431513101005 |
7 | 301545061163 |
oct | 54573357175 |
9 | 16444511865 |
10 | 6005055101 |
11 | 2601773861 |
12 | 11b70b7765 |
13 | 749148956 |
14 | 40d767233 |
15 | 2522d58bb |
hex | 165edde7d |
6005055101 has 4 divisors (see below), whose sum is σ = 6005467104. Its totient is φ = 6004643100.
The previous prime is 6005055083. The next prime is 6005055137. The reversal of 6005055101 is 1015505006.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6005055101 - 222 = 6000860797 is a prime.
It is a super-2 number, since 2×60050551012 = 72121373532092240402, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6005055191) 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 3 ways as a sum of consecutive naturals, for example, 183305 + ... + 213566.
It is an arithmetic number, because the mean of its divisors is an integer number (1501366776).
Almost surely, 26005055101 is an apocalyptic number.
It is an amenable number.
6005055101 is a deficient number, since it is larger than the sum of its proper divisors (412003).
6005055101 is a wasteful number, since it uses less digits than its factorization.
6005055101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412002.
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 6005055101 is about 77492.2905907420. The cubic root of 6005055101 is about 1817.6307678112.
The spelling of 6005055101 in words is "six billion, five million, fifty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •