Base | Representation |
---|---|
bin | 10011011011001100100001 |
3 | 100120201002101 |
4 | 103123030201 |
5 | 2300422004 |
6 | 301050401 |
7 | 61165600 |
oct | 23331441 |
9 | 10521071 |
10 | 5092129 |
11 | 2968879 |
12 | 1856a01 |
13 | 10939c3 |
14 | 967a37 |
15 | 6a8ba4 |
hex | 4db321 |
5092129 has 12 divisors (see below), whose sum is σ = 6272964. Its totient is φ = 4107264.
The previous prime is 5092127. The next prime is 5092141. The reversal of 5092129 is 9212905.
It can be written as a sum of positive squares in 2 ways, for example, as 3415104 + 1677025 = 1848^2 + 1295^2 .
It is not a de Polignac number, because 5092129 - 21 = 5092127 is a prime.
It is a super-3 number, since 3×50921293 (a number of 21 digits) contains 333 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5092097 and 5092106.
It is not an unprimeable number, because it can be changed into a prime (5092127) 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 11 ways as a sum of consecutive naturals, for example, 2224 + ... + 3889.
It is an arithmetic number, because the mean of its divisors is an integer number (522747).
Almost surely, 25092129 is an apocalyptic number.
It is an amenable number.
5092129 is a deficient number, since it is larger than the sum of its proper divisors (1180835).
5092129 is a wasteful number, since it uses less digits than its factorization.
5092129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6144 (or 6137 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 28.
The square root of 5092129 is about 2256.5746165372. The cubic root of 5092129 is about 172.0414651246.
The spelling of 5092129 in words is "five million, ninety-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •