Base | Representation |
---|---|
bin | 1110010000000110110… |
… | …00011111001001011111 |
3 | 1201210221211222221122012 |
4 | 13020003120133021133 |
5 | 31010332323204211 |
6 | 1012542434341435 |
7 | 50243542004501 |
oct | 7100330371137 |
9 | 1653854887565 |
10 | 489683022431 |
11 | 179745333559 |
12 | 7aaa1a2a87b |
13 | 3723b89a015 |
14 | 199b4d4bd71 |
15 | cb10010d8b |
hex | 720361f25f |
489683022431 has 4 divisors (see below), whose sum is σ = 489684422664. Its totient is φ = 489681622200.
The previous prime is 489683022379. The next prime is 489683022487. The reversal of 489683022431 is 134220386984.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 489683022431 - 214 = 489683006047 is a prime.
It is a super-2 number, since 2×4896830224312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 489683022431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (489683012431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 317216 + ... + 1039226.
It is an arithmetic number, because the mean of its divisors is an integer number (122421105666).
Almost surely, 2489683022431 is an apocalyptic number.
489683022431 is a deficient number, since it is larger than the sum of its proper divisors (1400233).
489683022431 is an equidigital number, since it uses as much as digits as its factorization.
489683022431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1400232.
The product of its (nonzero) digits is 1990656, while the sum is 50.
The spelling of 489683022431 in words is "four hundred eighty-nine billion, six hundred eighty-three million, twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •