Base | Representation |
---|---|
bin | 11101001101100… |
… | …111100011001011 |
3 | 1021011020010100001 |
4 | 131031213203023 |
5 | 2000431443011 |
6 | 120344423431 |
7 | 15100600411 |
oct | 3515474313 |
9 | 1234203301 |
10 | 490109131 |
11 | 231721276 |
12 | 118177b77 |
13 | 7a701105 |
14 | 4913d2b1 |
15 | 2d0627c1 |
hex | 1d3678cb |
490109131 has 2 divisors, whose sum is σ = 490109132. Its totient is φ = 490109130.
The previous prime is 490109111. The next prime is 490109149. The reversal of 490109131 is 131901094.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 490109131 - 27 = 490109003 is a prime.
It is a super-2 number, since 2×4901091312 = 480413920579150322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 490109131.
It is not a weakly prime, because it can be changed into another prime (490109111) 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, 245054565 + 245054566.
It is an arithmetic number, because the mean of its divisors is an integer number (245054566).
Almost surely, 2490109131 is an apocalyptic number.
490109131 is a deficient number, since it is larger than the sum of its proper divisors (1).
490109131 is an equidigital number, since it uses as much as digits as its factorization.
490109131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
The square root of 490109131 is about 22138.4085019678. The cubic root of 490109131 is about 788.4320398505.
The spelling of 490109131 in words is "four hundred ninety million, one hundred nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •