Base | Representation |
---|---|
bin | 10011010100110101110101 |
3 | 100112101101101 |
4 | 103110311311 |
5 | 2244103401 |
6 | 300330101 |
7 | 61026655 |
oct | 23246565 |
9 | 10471341 |
10 | 5066101 |
11 | 2950267 |
12 | 1843931 |
13 | 1084bc1 |
14 | 95c365 |
15 | 6a1101 |
hex | 4d4d75 |
5066101 has 4 divisors (see below), whose sum is σ = 5070604. Its totient is φ = 5061600.
The previous prime is 5066099. The next prime is 5066107. The reversal of 5066101 is 1016605.
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: 1016605 = 5 ⋅203321.
It can be written as a sum of positive squares in 2 ways, for example, as 3243601 + 1822500 = 1801^2 + 1350^2 .
It is a cyclic number.
It is not a de Polignac number, because 5066101 - 21 = 5066099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5066107) 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 3 ways as a sum of consecutive naturals, for example, 1081 + ... + 3361.
It is an arithmetic number, because the mean of its divisors is an integer number (1267651).
Almost surely, 25066101 is an apocalyptic number.
5066101 is the 1300-th hex number.
It is an amenable number.
5066101 is a deficient number, since it is larger than the sum of its proper divisors (4503).
5066101 is a wasteful number, since it uses less digits than its factorization.
5066101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4502.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 5066101 is about 2250.8000799716. The cubic root of 5066101 is about 171.7478389905.
The spelling of 5066101 in words is "five million, sixty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •