Base | Representation |
---|---|
bin | 10001100001101… |
… | …00110100011110 |
3 | 101020122020101201 |
4 | 20300310310132 |
5 | 300114020430 |
6 | 22331030114 |
7 | 3433423651 |
oct | 1060646436 |
9 | 336566351 |
10 | 147016990 |
11 | 75a9504a |
12 | 4129b33a |
13 | 245c6203 |
14 | 1574d898 |
15 | cd908ca |
hex | 8c34d1e |
147016990 has 8 divisors (see below), whose sum is σ = 264630600. Its totient is φ = 58806792.
The previous prime is 147016981. The next prime is 147016999. The reversal of 147016990 is 99610741.
It is an interprime number because it is at equal distance from previous prime (147016981) and next prime (147016999).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1470169902 = 43227990697320200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147016999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7350840 + ... + 7350859.
It is an arithmetic number, because the mean of its divisors is an integer number (33078825).
Almost surely, 2147016990 is an apocalyptic number.
147016990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
147016990 is a deficient number, since it is larger than the sum of its proper divisors (117613610).
147016990 is a wasteful number, since it uses less digits than its factorization.
147016990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14701706.
The product of its (nonzero) digits is 13608, while the sum is 37.
The square root of 147016990 is about 12125.0562885291. The cubic root of 147016990 is about 527.7835406532.
The spelling of 147016990 in words is "one hundred forty-seven million, sixteen thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •