Base | Representation |
---|---|
bin | 1110011001101110100… |
… | …01001000011101000101 |
3 | 1202022021211201020012021 |
4 | 13030313101020131011 |
5 | 31101422202230442 |
6 | 1015155200123141 |
7 | 50515543440010 |
oct | 7146721103505 |
9 | 1668254636167 |
10 | 494848476997 |
11 | 180956078a76 |
12 | 7baa39064b1 |
13 | 37882aa9004 |
14 | 19d44d9c377 |
15 | cd1374ae67 |
hex | 7337448745 |
494848476997 has 8 divisors (see below), whose sum is σ = 598808241216. Its totient is φ = 399205493952.
The previous prime is 494848476973. The next prime is 494848477021. The reversal of 494848476997 is 799674848494.
It is an interprime number because it is at equal distance from previous prime (494848476973) and next prime (494848477021).
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 494848476997 - 227 = 494714259269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (494848476917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2079195163 + ... + 2079195400.
It is an arithmetic number, because the mean of its divisors is an integer number (74851030152).
Almost surely, 2494848476997 is an apocalyptic number.
It is an amenable number.
494848476997 is a deficient number, since it is larger than the sum of its proper divisors (103959764219).
494848476997 is a wasteful number, since it uses less digits than its factorization.
494848476997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4158390587.
The product of its digits is 3511517184, while the sum is 79.
The spelling of 494848476997 in words is "four hundred ninety-four billion, eight hundred forty-eight million, four hundred seventy-six thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •