Base | Representation |
---|---|
bin | 101111100110000110… |
… | …100000011001100111 |
3 | 11212220121021100101121 |
4 | 233212012200121213 |
5 | 1314130401334021 |
6 | 35251035434411 |
7 | 3456301141465 |
oct | 574606403147 |
9 | 155817240347 |
10 | 51105105511 |
11 | 1a745555199 |
12 | 9aa2bb5a07 |
13 | 4a859ba505 |
14 | 268b3db835 |
15 | 14e18d8741 |
hex | be61a0667 |
51105105511 has 8 divisors (see below), whose sum is σ = 52448101200. Its totient is φ = 49778003520.
The previous prime is 51105105503. The next prime is 51105105517. The reversal of 51105105511 is 11550150115.
51105105511 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51105105511 - 23 = 51105105503 is a prime.
It is a super-2 number, since 2×511051055112 (a number of 22 digits) 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 (51105105517) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3966910 + ... + 3979771.
It is an arithmetic number, because the mean of its divisors is an integer number (6556012650).
Almost surely, 251105105511 is an apocalyptic number.
51105105511 is a deficient number, since it is larger than the sum of its proper divisors (1342995689).
51105105511 is a wasteful number, since it uses less digits than its factorization.
51105105511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7946849.
The product of its (nonzero) digits is 625, while the sum is 25.
Adding to 51105105511 its reverse (11550150115), we get a palindrome (62655255626).
The spelling of 51105105511 in words is "fifty-one billion, one hundred five million, one hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.256 sec. • engine limits •