Base | Representation |
---|---|
bin | 1001001000010111… |
… | …11110010100111101 |
3 | 110122122010202201212 |
4 | 10210023332110331 |
5 | 40014413222244 |
6 | 2130232414205 |
7 | 232323020525 |
oct | 44413762475 |
9 | 13578122655 |
10 | 4902085949 |
11 | 2096110802 |
12 | b49847365 |
13 | 601798697 |
14 | 347094685 |
15 | 1da564d9e |
hex | 1242fe53d |
4902085949 has 8 divisors (see below), whose sum is σ = 5199091128. Its totient is φ = 4606041600.
The previous prime is 4902085943. The next prime is 4902085967. The reversal of 4902085949 is 9495802094.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2062794724 + 2839291225 = 45418^2 + 53285^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4902085949 - 28 = 4902085693 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4902085897 and 4902085906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4902085943) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 229682 + ... + 250115.
It is an arithmetic number, because the mean of its divisors is an integer number (649886391).
Almost surely, 24902085949 is an apocalyptic number.
It is an amenable number.
4902085949 is a deficient number, since it is larger than the sum of its proper divisors (297005179).
4902085949 is a wasteful number, since it uses less digits than its factorization.
4902085949 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 480415.
The product of its (nonzero) digits is 933120, while the sum is 50.
The square root of 4902085949 is about 70014.8980503435. The cubic root of 4902085949 is about 1698.7402372882.
The spelling of 4902085949 in words is "four billion, nine hundred two million, eighty-five thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •