Base | Representation |
---|---|
bin | 10011100010010010001011 |
3 | 100122011220201 |
4 | 103202102023 |
5 | 2302334123 |
6 | 301433031 |
7 | 61346335 |
oct | 23422213 |
9 | 10564821 |
10 | 5121163 |
11 | 2988673 |
12 | 186b777 |
13 | 10a3c98 |
14 | 974455 |
15 | 6b25ad |
hex | 4e248b |
5121163 has 4 divisors (see below), whose sum is σ = 5125720. Its totient is φ = 5116608.
The previous prime is 5121161. The next prime is 5121173. The reversal of 5121163 is 3611215.
5121163 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 3611215 = 5 ⋅722243.
It is a cyclic number.
It is not a de Polignac number, because 5121163 - 21 = 5121161 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5121163.
It is not an unprimeable number, because it can be changed into a prime (5121161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 748 + ... + 3286.
It is an arithmetic number, because the mean of its divisors is an integer number (1281430).
Almost surely, 25121163 is an apocalyptic number.
5121163 is a deficient number, since it is larger than the sum of its proper divisors (4557).
5121163 is a wasteful number, since it uses less digits than its factorization.
5121163 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4556.
The product of its digits is 180, while the sum is 19.
The square root of 5121163 is about 2262.9986743257. The cubic root of 5121163 is about 172.3678242539.
Adding to 5121163 its reverse (3611215), we get a palindrome (8732378).
The spelling of 5121163 in words is "five million, one hundred twenty-one thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •