Base | Representation |
---|---|
bin | 1110010010001110111… |
… | …10000000001010010011 |
3 | 1201220220110102122000201 |
4 | 13021013132000022103 |
5 | 31020202240202214 |
6 | 1013252042000031 |
7 | 50314052242405 |
oct | 7110736001223 |
9 | 1656813378021 |
10 | 490825319059 |
11 | 17a181107959 |
12 | 7b1604a6017 |
13 | 3739143999a |
14 | 19a8293ab75 |
15 | cb7a44e274 |
hex | 7247780293 |
490825319059 has 2 divisors, whose sum is σ = 490825319060. Its totient is φ = 490825319058.
The previous prime is 490825319057. The next prime is 490825319099. The reversal of 490825319059 is 950913528094.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 490825319059 - 21 = 490825319057 is a prime.
Together with 490825319057, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (490825319053) 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 as a sum of consecutive naturals, namely, 245412659529 + 245412659530.
It is an arithmetic number, because the mean of its divisors is an integer number (245412659530).
Almost surely, 2490825319059 is an apocalyptic number.
490825319059 is a deficient number, since it is larger than the sum of its proper divisors (1).
490825319059 is an equidigital number, since it uses as much as digits as its factorization.
490825319059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3499200, while the sum is 55.
The spelling of 490825319059 in words is "four hundred ninety billion, eight hundred twenty-five million, three hundred nineteen thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •