Base | Representation |
---|---|
bin | 1110010000001110110… |
… | …11110001100100001010 |
3 | 1201211010120220012221200 |
4 | 13020013123301210022 |
5 | 31011002223240122 |
6 | 1012553303245030 |
7 | 50245325520054 |
oct | 7100733614412 |
9 | 1654116805850 |
10 | 489750993162 |
11 | 17977a738a12 |
12 | 7ab00749776 |
13 | 3724c9a7ca2 |
14 | 199bdda28d4 |
15 | cb15e8a5ac |
hex | 72076f190a |
489750993162 has 12 divisors (see below), whose sum is σ = 1061127151890. Its totient is φ = 163250331048.
The previous prime is 489750993131. The next prime is 489750993163. The reversal of 489750993162 is 261399057984.
489750993162 is a `hidden beast` number, since 4 + 8 + 97 + 509 + 9 + 31 + 6 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 485030066481 + 4720926681 = 696441^2 + 68709^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 489750993162.
It is not an unprimeable number, because it can be changed into a prime (489750993163) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13604194237 + ... + 13604194272.
It is a 2-persistent number, because it is pandigital, and so is 2⋅489750993162 = 979501986324, but 3⋅489750993162 = 1469252979486 is not.
Almost surely, 2489750993162 is an apocalyptic number.
489750993162 is an abundant number, since it is smaller than the sum of its proper divisors (571376158728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
489750993162 is a wasteful number, since it uses less digits than its factorization.
489750993162 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27208388517 (or 27208388514 counting only the distinct ones).
The product of its (nonzero) digits is 29393280, while the sum is 63.
The spelling of 489750993162 in words is "four hundred eighty-nine billion, seven hundred fifty million, nine hundred ninety-three thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •