Base | Representation |
---|---|
bin | 10001101000110001011… |
… | …11101101101111100011 |
3 | 2010221012120100121101220 |
4 | 20310120233231233203 |
5 | 34412044410100201 |
6 | 1142221202030123 |
7 | 61532245120206 |
oct | 10643057555743 |
9 | 2127176317356 |
10 | 606005550051 |
11 | 214007375200 |
12 | 99546048343 |
13 | 451b8c1a515 |
14 | 2148bad993d |
15 | 10b6c200036 |
hex | 8d18bedbe3 |
606005550051 has 48 divisors (see below), whose sum is σ = 897844329984. Its totient is φ = 363270600000.
The previous prime is 606005550019. The next prime is 606005550053. The reversal of 606005550051 is 150055500606.
It is not a de Polignac number, because 606005550051 - 25 = 606005550019 is a prime.
It is a super-2 number, since 2×6060055500512 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 606005549994 and 606005550021.
It is not an unprimeable number, because it can be changed into a prime (606005550053) 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 47 ways as a sum of consecutive naturals, for example, 38524950 + ... + 38540676.
It is an arithmetic number, because the mean of its divisors is an integer number (18705090208).
Almost surely, 2606005550051 is an apocalyptic number.
606005550051 is a deficient number, since it is larger than the sum of its proper divisors (291838779933).
606005550051 is a wasteful number, since it uses less digits than its factorization.
606005550051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16904 (or 16893 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 606005550051 in words is "six hundred six billion, five million, five hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •