Base | Representation |
---|---|
bin | 1110010001110110110… |
… | …10000001111011101111 |
3 | 1201220101100122021110000 |
4 | 13020323122001323233 |
5 | 31014243433414101 |
6 | 1013220012315343 |
7 | 50306044163454 |
oct | 7107332017357 |
9 | 1656340567400 |
10 | 490622951151 |
11 | 17a087957953 |
12 | 7b104772b53 |
13 | 3735b533968 |
14 | 19a63add82b |
15 | cb677c8486 |
hex | 723b681eef |
490622951151 has 10 divisors (see below), whose sum is σ = 732905890112. Its totient is φ = 327081967380.
The previous prime is 490622951099. The next prime is 490622951177. The reversal of 490622951151 is 151159226094.
490622951151 is a `hidden beast` number, since 4 + 9 + 0 + 62 + 29 + 511 + 51 = 666.
It is not a de Polignac number, because 490622951151 - 27 = 490622951023 is a prime.
It is a super-2 number, since 2×4906229511512 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 490622951097 and 490622951106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (490622951851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3028536655 + ... + 3028536816.
Almost surely, 2490622951151 is an apocalyptic number.
490622951151 is a deficient number, since it is larger than the sum of its proper divisors (242282938961).
490622951151 is an equidigital number, since it uses as much as digits as its factorization.
490622951151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6057073483 (or 6057073474 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 45.
The spelling of 490622951151 in words is "four hundred ninety billion, six hundred twenty-two million, nine hundred fifty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •