Base | Representation |
---|---|
bin | 1001001000010111… |
… | …01100000000110011 |
3 | 110122121222221211102 |
4 | 10210023230000303 |
5 | 40014403322211 |
6 | 2130231035015 |
7 | 232322256026 |
oct | 44413540063 |
9 | 13577887742 |
10 | 4902010931 |
11 | 209606a404 |
12 | b4980ba6b |
13 | 6017704ac |
14 | 3470751bd |
15 | 1da54ca3b |
hex | 1242ec033 |
4902010931 has 4 divisors (see below), whose sum is σ = 4912929000. Its totient is φ = 4891092864.
The previous prime is 4902010921. The next prime is 4902010943. The reversal of 4902010931 is 1390102094.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4902010931 - 226 = 4834902067 is a prime.
It is a super-2 number, since 2×49020109312 = 48059422335286973522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4902010894 and 4902010903.
It is not an unprimeable number, because it can be changed into a prime (4902010921) 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, 5458361 + ... + 5459258.
It is an arithmetic number, because the mean of its divisors is an integer number (1228232250).
Almost surely, 24902010931 is an apocalyptic number.
4902010931 is a deficient number, since it is larger than the sum of its proper divisors (10918069).
4902010931 is a wasteful number, since it uses less digits than its factorization.
4902010931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10918068.
The product of its (nonzero) digits is 1944, while the sum is 29.
The square root of 4902010931 is about 70014.3623194556. The cubic root of 4902010931 is about 1698.7315718108.
The spelling of 4902010931 in words is "four billion, nine hundred two million, ten thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •