Base | Representation |
---|---|
bin | 1110111000000000100… |
… | …10110111101101100001 |
3 | 1210212020212012202121020 |
4 | 13130000102313231201 |
5 | 31333221122230014 |
6 | 1030444320320053 |
7 | 51632453533434 |
oct | 7340022675541 |
9 | 1725225182536 |
10 | 511106055009 |
11 | 187839052a60 |
12 | 83080473029 |
13 | 39274028c64 |
14 | 1aa4821d81b |
15 | d465b711a9 |
hex | 77004b7b61 |
511106055009 has 16 divisors (see below), whose sum is σ = 749102010624. Its totient is φ = 307396653200.
The previous prime is 511106054999. The next prime is 511106055017. The reversal of 511106055009 is 900550601115.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-511106055009 is a prime.
It is a super-2 number, since 2×5111060550092 (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 Curzon number.
It is not an unprimeable number, because it can be changed into a prime (511106055049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59110419 + ... + 59119064.
It is an arithmetic number, because the mean of its divisors is an integer number (46818875664).
Almost surely, 2511106055009 is an apocalyptic number.
It is an amenable number.
511106055009 is a deficient number, since it is larger than the sum of its proper divisors (237995955615).
511106055009 is a wasteful number, since it uses less digits than its factorization.
511106055009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118229628.
The product of its (nonzero) digits is 6750, while the sum is 33.
The spelling of 511106055009 in words is "five hundred eleven billion, one hundred six million, fifty-five thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •