Base | Representation |
---|---|
bin | 1001111101010010101… |
… | …1111001000000000000 |
3 | 121100120022011000200000 |
4 | 2133110223321000000 |
5 | 10300323413000000 |
6 | 210331150400000 |
7 | 15234216002406 |
oct | 2372453710000 |
9 | 540508130600 |
10 | 171072000000 |
11 | 66607758690 |
12 | 291a3800000 |
13 | 13194083205 |
14 | 83cc1a7476 |
15 | 46b3a00000 |
hex | 27d4af9000 |
171072000000 has 1092 divisors, whose sum is σ = 698785742928. Its totient is φ = 41472000000.
The previous prime is 171071999981. The next prime is 171072000013. The reversal of 171072000000 is 270171.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 15551999995 + ... + 15552000005.
It is an arithmetic number, because the mean of its divisors is an integer number (639913684).
Almost surely, 2171072000000 is an apocalyptic number.
171072000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 171072000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (349392871464).
171072000000 is an abundant number, since it is smaller than the sum of its proper divisors (527713742928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
171072000000 is an frugal number, since it uses more digits than its factorization.
171072000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80 (or 21 counting only the distinct ones).
The product of its (nonzero) digits is 98, while the sum is 18.
Adding to 171072000000 its reverse (270171), we get a palindrome (171072270171).
The spelling of 171072000000 in words is "one hundred seventy-one billion, seventy-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •