Base | Representation |
---|---|
bin | 1100001011111… |
… | …0010011000110 |
3 | 10120011201021002 |
4 | 3002332103012 |
5 | 101041023420 |
6 | 5023253302 |
7 | 1160302661 |
oct | 302762306 |
9 | 116151232 |
10 | 51111110 |
11 | 2693a596 |
12 | 1514a232 |
13 | a78707b |
14 | 6b066d8 |
15 | 4749075 |
hex | 30be4c6 |
51111110 has 16 divisors (see below), whose sum is σ = 93560400. Its totient is φ = 20097696.
The previous prime is 51111103. The next prime is 51111119. The reversal of 51111110 is 1111115.
It is a happy number.
51111110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×511111102 = 5224691130864200, which contains 22 as substring.
It is a nialpdrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 51111091 and 51111100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51111119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42725 + ... + 43904.
It is an arithmetic number, because the mean of its divisors is an integer number (5847525).
Almost surely, 251111110 is an apocalyptic number.
51111110 is a deficient number, since it is larger than the sum of its proper divisors (42449290).
51111110 is a wasteful number, since it uses less digits than its factorization.
51111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86695.
The product of its (nonzero) digits is 5, while the sum is 11.
The square root of 51111110 is about 7149.2034521337. The cubic root of 51111110 is about 371.1120911511.
Adding to 51111110 its reverse (1111115), we get a palindrome (52222225).
The spelling of 51111110 in words is "fifty-one million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •