Base | Representation |
---|---|
bin | 100001100010011101110000… |
… | …000111101001111101101001 |
3 | 201100021020110101200101101220 |
4 | 201202131300013221331221 |
5 | 123313201033340322414 |
6 | 1241414213105532253 |
7 | 43032544132401630 |
oct | 4142356007517551 |
9 | 640236411611356 |
10 | 147503942901609 |
11 | 42aaa086391358 |
12 | 14663304044089 |
13 | 643c740006168 |
14 | 285d32c276517 |
15 | 120bdb1a65ca9 |
hex | 8627701e9f69 |
147503942901609 has 16 divisors (see below), whose sum is σ = 224768561836032. Its totient is φ = 84287724056208.
The previous prime is 147503942901607. The next prime is 147503942901613. The reversal of 147503942901609 is 906109249305741.
147503942901609 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 147503942901609 - 21 = 147503942901607 is a prime.
It is a super-2 number, since 2×1475039429016092 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (147503942901607) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2558499 + ... + 17365304.
It is an arithmetic number, because the mean of its divisors is an integer number (14048035114752).
Almost surely, 2147503942901609 is an apocalyptic number.
It is an amenable number.
147503942901609 is a deficient number, since it is larger than the sum of its proper divisors (77264618934423).
147503942901609 is a wasteful number, since it uses less digits than its factorization.
147503942901609 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20276356.
The product of its (nonzero) digits is 14696640, while the sum is 60.
The spelling of 147503942901609 in words is "one hundred forty-seven trillion, five hundred three billion, nine hundred forty-two million, nine hundred one thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •