Base | Representation |
---|---|
bin | 1000100111010101100… |
… | …1111001010000111001 |
3 | 112011000021111101121010 |
4 | 2021311121321100321 |
5 | 4411100121013424 |
6 | 151553431504133 |
7 | 13456354301262 |
oct | 2116531712071 |
9 | 464007441533 |
10 | 147998610489 |
11 | 578473a2634 |
12 | 24824528049 |
13 | 10c57a39802 |
14 | 723da53969 |
15 | 3cb3045229 |
hex | 2275679439 |
147998610489 has 32 divisors (see below), whose sum is σ = 212986506240. Its totient is φ = 91064809472.
The previous prime is 147998610481. The next prime is 147998610497. The reversal of 147998610489 is 984016899741.
It is a happy number.
147998610489 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (147998610481) and next prime (147998610497).
It is a cyclic number.
It is not a de Polignac number, because 147998610489 - 23 = 147998610481 is a prime.
It is not an unprimeable number, because it can be changed into a prime (147998610481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5953117 + ... + 5977925.
It is an arithmetic number, because the mean of its divisors is an integer number (6655828320).
Almost surely, 2147998610489 is an apocalyptic number.
It is an amenable number.
147998610489 is a deficient number, since it is larger than the sum of its proper divisors (64987895751).
147998610489 is a wasteful number, since it uses less digits than its factorization.
147998610489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27089.
The product of its (nonzero) digits is 31352832, while the sum is 66.
The spelling of 147998610489 in words is "one hundred forty-seven billion, nine hundred ninety-eight million, six hundred ten thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •