Base | Representation |
---|---|
bin | 1110101110011111111… |
… | …11001000001111001011 |
3 | 1210101002001102002101221 |
4 | 13113033333020033023 |
5 | 31242242123344110 |
6 | 1024241541022511 |
7 | 51362111121052 |
oct | 7271777101713 |
9 | 1711061362357 |
10 | 506000606155 |
11 | 185659172740 |
12 | 820966b4a37 |
13 | 3893c3996c5 |
14 | 1a6c214d399 |
15 | d26783a7da |
hex | 75cffc83cb |
506000606155 has 8 divisors (see below), whose sum is σ = 662400793584. Its totient is φ = 368000440800.
The previous prime is 506000606149. The next prime is 506000606161. The reversal of 506000606155 is 551606000605.
It is an interprime number because it is at equal distance from previous prime (506000606149) and next prime (506000606161).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 506000606155 - 23 = 506000606147 is a prime.
It is a super-2 number, since 2×5060006061552 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 506000606155.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4600005456 + ... + 4600005565.
It is an arithmetic number, because the mean of its divisors is an integer number (82800099198).
Almost surely, 2506000606155 is an apocalyptic number.
506000606155 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
506000606155 is a deficient number, since it is larger than the sum of its proper divisors (156400187429).
506000606155 is a wasteful number, since it uses less digits than its factorization.
506000606155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9200011037.
The product of its (nonzero) digits is 27000, while the sum is 34.
The spelling of 506000606155 in words is "five hundred six billion, six hundred six thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •