Base | Representation |
---|---|
bin | 1001111101000001100… |
… | …1010010100010001011 |
3 | 121100101021200210210102 |
4 | 2133100121102202023 |
5 | 10300202000434422 |
6 | 210320055440015 |
7 | 15232353100514 |
oct | 2372031224213 |
9 | 540337623712 |
10 | 171000014987 |
11 | 6658006123a |
12 | 2918368600b |
13 | 1318219b029 |
14 | 83c27c9a0b |
15 | 46ac531192 |
hex | 27d065288b |
171000014987 has 16 divisors (see below), whose sum is σ = 183222777600. Its totient is φ = 159020252160.
The previous prime is 171000014963. The next prime is 171000015019. The reversal of 171000014987 is 789410000171.
It is a happy number.
It is not a de Polignac number, because 171000014987 - 222 = 170995820683 is a prime.
It is a super-2 number, since 2×1710000149872 (a number of 23 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 171000014987.
It is not an unprimeable number, because it can be changed into a prime (171000014917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2137937 + ... + 2216477.
It is an arithmetic number, because the mean of its divisors is an integer number (11451423600).
Almost surely, 2171000014987 is an apocalyptic number.
171000014987 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
171000014987 is a deficient number, since it is larger than the sum of its proper divisors (12222762613).
171000014987 is a wasteful number, since it uses less digits than its factorization.
171000014987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80086.
The product of its (nonzero) digits is 14112, while the sum is 38.
The spelling of 171000014987 in words is "one hundred seventy-one billion, fourteen thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •