Base | Representation |
---|---|
bin | 10011011011001011100101 |
3 | 100120201000011 |
4 | 103123023211 |
5 | 2300421234 |
6 | 301050221 |
7 | 61165453 |
oct | 23331345 |
9 | 10521004 |
10 | 5092069 |
11 | 2968824 |
12 | 1856971 |
13 | 1093978 |
14 | 9679d3 |
15 | 6a8b64 |
hex | 4db2e5 |
5092069 has 2 divisors, whose sum is σ = 5092070. Its totient is φ = 5092068.
The previous prime is 5092007. The next prime is 5092079. The reversal of 5092069 is 9602905.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3496900 + 1595169 = 1870^2 + 1263^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5092069 is a prime.
It is a super-2 number, since 2×50920692 = 51858333401522, which contains 22 as substring.
It is a Chen prime.
5092069 is a lucky number.
It is a self number, because there is not a number n which added to its sum of digits gives 5092069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5092079) 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 as a sum of consecutive naturals, namely, 2546034 + 2546035.
It is an arithmetic number, because the mean of its divisors is an integer number (2546035).
Almost surely, 25092069 is an apocalyptic number.
It is an amenable number.
5092069 is a deficient number, since it is larger than the sum of its proper divisors (1).
5092069 is an equidigital number, since it uses as much as digits as its factorization.
5092069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 5092069 is about 2256.5613220119. The cubic root of 5092069 is about 172.0407894067.
It can be divided in two parts, 509206 and 9, that multiplied together give a palindrome (4582854).
The spelling of 5092069 in words is "five million, ninety-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •