Base | Representation |
---|---|
bin | 1110110111110101001… |
… | …10100101110001011001 |
3 | 1210212000012112011121021 |
4 | 13123322212211301121 |
5 | 31333022200423423 |
6 | 1030431025442441 |
7 | 51630214046533 |
oct | 7337246456131 |
9 | 1725005464537 |
10 | 511010561113 |
11 | 18779a159a88 |
12 | 830544a0421 |
13 | 3925a3024b0 |
14 | 1aa39682853 |
15 | d45c5ab95d |
hex | 76fa9a5c59 |
511010561113 has 16 divisors (see below), whose sum is σ = 553088964736. Its totient is φ = 469333388160.
The previous prime is 511010561111. The next prime is 511010561147. The reversal of 511010561113 is 311165010115.
It is not a de Polignac number, because 511010561113 - 21 = 511010561111 is a prime.
It is a super-2 number, since 2×5110105611132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (511010561111) 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 15 ways as a sum of consecutive naturals, for example, 2110948 + ... + 2340538.
It is an arithmetic number, because the mean of its divisors is an integer number (34568060296).
Almost surely, 2511010561113 is an apocalyptic number.
It is an amenable number.
511010561113 is a deficient number, since it is larger than the sum of its proper divisors (42078403623).
511010561113 is a wasteful number, since it uses less digits than its factorization.
511010561113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230464.
The product of its (nonzero) digits is 450, while the sum is 25.
Adding to 511010561113 its reverse (311165010115), we get a palindrome (822175571228).
The spelling of 511010561113 in words is "five hundred eleven billion, ten million, five hundred sixty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •