Base | Representation |
---|---|
bin | 10111001101110000001111… |
… | …01111001110010011001111 |
3 | 20200202100021000110022221200 |
4 | 23212320013233032103033 |
5 | 23142401111420200421 |
6 | 300324033002400543 |
7 | 13516151225456004 |
oct | 1346700757162317 |
9 | 220670230408850 |
10 | 51050111100111 |
11 | 152a225992a202 |
12 | 5885a2ab00153 |
13 | 226400a78a536 |
14 | c86ba50218ab |
15 | 5d7de58b4726 |
hex | 2e6e07bce4cf |
51050111100111 has 48 divisors (see below), whose sum is σ = 74808318224640. Its totient is φ = 33543525600000.
The previous prime is 51050111100097. The next prime is 51050111100137. The reversal of 51050111100111 is 11100111105015.
51050111100111 is a `hidden beast` number, since 51 + 0 + 501 + 1 + 1 + 1 + 0 + 0 + 111 = 666.
It is not a de Polignac number, because 51050111100111 - 27 = 51050111099983 is a prime.
It is a super-2 number, since 2×510501111001112 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51050111100161) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1041623175 + ... + 1041672183.
It is an arithmetic number, because the mean of its divisors is an integer number (1558506629680).
Almost surely, 251050111100111 is an apocalyptic number.
51050111100111 is a deficient number, since it is larger than the sum of its proper divisors (23758207124529).
51050111100111 is a wasteful number, since it uses less digits than its factorization.
51050111100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55148 (or 55145 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 18.
Adding to 51050111100111 its reverse (11100111105015), we get a palindrome (62150222205126).
The spelling of 51050111100111 in words is "fifty-one trillion, fifty billion, one hundred eleven million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •