Base | Representation |
---|---|
bin | 1110001110110110100… |
… | …01011111101110001011 |
3 | 1201202012221210000011002 |
4 | 13013123101133232023 |
5 | 31002443041214011 |
6 | 1012351555325215 |
7 | 50221061164016 |
oct | 7073321375613 |
9 | 1652187700132 |
10 | 489010101131 |
11 | 17942a4a9852 |
12 | 7a9345b080b |
13 | 3716234c036 |
14 | 1994d82237d |
15 | cac0ddbc3b |
hex | 71db45fb8b |
489010101131 has 2 divisors, whose sum is σ = 489010101132. Its totient is φ = 489010101130.
The previous prime is 489010101109. The next prime is 489010101143. The reversal of 489010101131 is 131101010984.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 489010101131 - 222 = 489005906827 is a prime.
It is a super-2 number, since 2×4890101011312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 489010101094 and 489010101103.
It is not a weakly prime, because it can be changed into another prime (489010106131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 244505050565 + 244505050566.
It is an arithmetic number, because the mean of its divisors is an integer number (244505050566).
Almost surely, 2489010101131 is an apocalyptic number.
489010101131 is a deficient number, since it is larger than the sum of its proper divisors (1).
489010101131 is an equidigital number, since it uses as much as digits as its factorization.
489010101131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 29.
The spelling of 489010101131 in words is "four hundred eighty-nine billion, ten million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •