Base | Representation |
---|---|
bin | 10011101101010010010101 |
3 | 100201110201211 |
4 | 103231102111 |
5 | 2310304404 |
6 | 302421421 |
7 | 61624615 |
oct | 23552225 |
9 | 10643654 |
10 | 5166229 |
11 | 2a09512 |
12 | 1891871 |
13 | 10bb653 |
14 | 986a45 |
15 | 6c0b04 |
hex | 4ed495 |
5166229 has 4 divisors (see below), whose sum is σ = 5171040. Its totient is φ = 5161420.
The previous prime is 5166223. The next prime is 5166253. The reversal of 5166229 is 9226615.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5166229 - 23 = 5166221 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
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 5166229.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5166221) 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, 24 + ... + 3214.
It is an arithmetic number, because the mean of its divisors is an integer number (1292760).
Almost surely, 25166229 is an apocalyptic number.
It is an amenable number.
5166229 is a deficient number, since it is larger than the sum of its proper divisors (4811).
5166229 is a wasteful number, since it uses less digits than its factorization.
5166229 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4810.
The product of its digits is 6480, while the sum is 31.
The square root of 5166229 is about 2272.9340069610. The cubic root of 5166229 is about 172.8719580031.
The spelling of 5166229 in words is "five million, one hundred sixty-six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •