Base | Representation |
---|---|
bin | 10011100010010001001111 |
3 | 100122011211111 |
4 | 103202101033 |
5 | 2302333403 |
6 | 301432451 |
7 | 61346221 |
oct | 23422117 |
9 | 10564744 |
10 | 5121103 |
11 | 2988619 |
12 | 186b727 |
13 | 10a3c50 |
14 | 974411 |
15 | 6b256d |
hex | 4e244f |
5121103 has 4 divisors (see below), whose sum is σ = 5515048. Its totient is φ = 4727160.
The previous prime is 5121071. The next prime is 5121113. The reversal of 5121103 is 3011215.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5121103 - 25 = 5121071 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 393931 = 5121103 / (5 + 1 + 2 + 1 + 1 + 0 + 3).
It is a Duffinian number.
5121103 is a lucky number.
It is a nialpdrome in base 14.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5121113) 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, 196953 + ... + 196978.
It is an arithmetic number, because the mean of its divisors is an integer number (1378762).
Almost surely, 25121103 is an apocalyptic number.
5121103 is a deficient number, since it is larger than the sum of its proper divisors (393945).
5121103 is a wasteful number, since it uses less digits than its factorization.
5121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393944.
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 5121103 is about 2262.9854175403. The cubic root of 5121103 is about 172.3671510923.
Adding to 5121103 its reverse (3011215), we get a palindrome (8132318).
The spelling of 5121103 in words is "five million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •