Base | Representation |
---|---|
bin | 101111100110011100… |
… | …111111101111011011 |
3 | 11212221000100212112221 |
4 | 233212130333233123 |
5 | 1314133404013201 |
6 | 35251410044511 |
7 | 3456402224605 |
oct | 574634775733 |
9 | 155830325487 |
10 | 51111001051 |
11 | 1a748911640 |
12 | 9aa4b79737 |
13 | 4a86ca2ab6 |
14 | 268c0d4175 |
15 | 14e21a04a1 |
hex | be673fbdb |
51111001051 has 16 divisors (see below), whose sum is σ = 58190093568. Its totient is φ = 44437932000.
The previous prime is 51111001009. The next prime is 51111001057. The reversal of 51111001051 is 15010011115.
It is not a de Polignac number, because 51111001051 - 213 = 51110992859 is a prime.
It is a super-2 number, since 2×511110010512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51111001057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2854276 + ... + 2872126.
It is an arithmetic number, because the mean of its divisors is an integer number (3636880848).
Almost surely, 251111001051 is an apocalyptic number.
51111001051 is a deficient number, since it is larger than the sum of its proper divisors (7079092517).
51111001051 is a wasteful number, since it uses less digits than its factorization.
51111001051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29202.
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 51111001051 its reverse (15010011115), we get a palindrome (66121012166).
The spelling of 51111001051 in words is "fifty-one billion, one hundred eleven million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •