Base | Representation |
---|---|
bin | 1100001010100… |
… | …0110100000111 |
3 | 10120000020112212 |
4 | 3002220310013 |
5 | 101030214421 |
6 | 5021334035 |
7 | 1156455266 |
oct | 302506407 |
9 | 116006485 |
10 | 51023111 |
11 | 2688a467 |
12 | 1510731b |
13 | a755cb9 |
14 | 6ac25dd |
15 | 472ce5b |
hex | 30a8d07 |
51023111 has 4 divisors (see below), whose sum is σ = 52402152. Its totient is φ = 49644072.
The previous prime is 51023107. The next prime is 51023129. The reversal of 51023111 is 11132015.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11132015 = 5 ⋅2226403.
It is a cyclic number.
It is not a de Polignac number, because 51023111 - 22 = 51023107 is a prime.
It is a super-2 number, since 2×510231112 = 5206715712236642, which 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 (51023101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 689465 + ... + 689538.
It is an arithmetic number, because the mean of its divisors is an integer number (13100538).
Almost surely, 251023111 is an apocalyptic number.
51023111 is a deficient number, since it is larger than the sum of its proper divisors (1379041).
51023111 is a wasteful number, since it uses less digits than its factorization.
51023111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1379040.
The product of its (nonzero) digits is 30, while the sum is 14.
The square root of 51023111 is about 7143.0463389229. The cubic root of 51023111 is about 370.8989851473.
Adding to 51023111 its reverse (11132015), we get a palindrome (62155126).
The spelling of 51023111 in words is "fifty-one million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •