Base | Representation |
---|---|
bin | 1100001100000… |
… | …0101110111011 |
3 | 10120012012221110 |
4 | 3003000232323 |
5 | 101041333313 |
6 | 5023411403 |
7 | 1160344026 |
oct | 303005673 |
9 | 116165843 |
10 | 51121083 |
11 | 26947032 |
12 | 15153b63 |
13 | a78b780 |
14 | 6b0a1bd |
15 | 474bec3 |
hex | 30c0bbb |
51121083 has 8 divisors (see below), whose sum is σ = 73404688. Its totient is φ = 31459104.
The previous prime is 51121073. The next prime is 51121117. The reversal of 51121083 is 38012115.
51121083 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 not a de Polignac number, because 51121083 - 28 = 51120827 is a prime.
It is a super-2 number, since 2×511210832 = 5226730254185778, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51121033) 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, 655360 + ... + 655437.
It is an arithmetic number, because the mean of its divisors is an integer number (9175586).
Almost surely, 251121083 is an apocalyptic number.
51121083 is a deficient number, since it is larger than the sum of its proper divisors (22283605).
51121083 is a wasteful number, since it uses less digits than its factorization.
51121083 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1310813.
The product of its (nonzero) digits is 240, while the sum is 21.
The square root of 51121083 is about 7149.9009084043. The cubic root of 51121083 is about 371.1362271963.
Adding to 51121083 its reverse (38012115), we get a palindrome (89133198).
The spelling of 51121083 in words is "fifty-one million, one hundred twenty-one thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •