Base | Representation |
---|---|
bin | 1001011111000010… |
… | …01101100110110001 |
3 | 111010212212201012111 |
4 | 10233201031212301 |
5 | 40412100443204 |
6 | 2201143325321 |
7 | 240122003452 |
oct | 45741154661 |
9 | 14125781174 |
10 | 5092202929 |
11 | 2183463480 |
12 | ba1450841 |
13 | 631ca2438 |
14 | 364423129 |
15 | 1ec0bad04 |
hex | 12f84d9b1 |
5092202929 has 4 divisors (see below), whose sum is σ = 5555130480. Its totient is φ = 4629275380.
The previous prime is 5092202923. The next prime is 5092202971. The reversal of 5092202929 is 9292022905.
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.
It is a cyclic number.
It is not a de Polignac number, because 5092202929 - 229 = 4555332017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5092202891 and 5092202900.
It is not an unprimeable number, because it can be changed into a prime (5092202923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 231463759 + ... + 231463780.
It is an arithmetic number, because the mean of its divisors is an integer number (1388782620).
Almost surely, 25092202929 is an apocalyptic number.
It is an amenable number.
5092202929 is a deficient number, since it is larger than the sum of its proper divisors (462927551).
5092202929 is a wasteful number, since it uses less digits than its factorization.
5092202929 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462927550.
The product of its (nonzero) digits is 58320, while the sum is 40.
The square root of 5092202929 is about 71359.6729883202. The cubic root of 5092202929 is about 1720.4229770316.
The spelling of 5092202929 in words is "five billion, ninety-two million, two hundred two thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •