Base | Representation |
---|---|
bin | 1001111110110110011… |
… | …1010000001111110000 |
3 | 121101122110002112122121 |
4 | 2133231213100033300 |
5 | 10302202443334041 |
6 | 210440450244024 |
7 | 15250454530000 |
oct | 2375547201760 |
9 | 541573075577 |
10 | 171490214896 |
11 | 66801834730 |
12 | 2929b886614 |
13 | 1322c901550 |
14 | 842b950000 |
15 | 46da5b07d1 |
hex | 27ed9d03f0 |
171490214896 has 800 divisors, whose sum is σ = 504147732480. Its totient is φ = 55477094400.
The previous prime is 171490214893. The next prime is 171490214897. The reversal of 171490214896 is 698412094171.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (171490214893) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 3235664406 + ... + 3235664458.
Almost surely, 2171490214896 is an apocalyptic number.
171490214896 is a gapful number since it is divisible by the number (16) 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 171490214896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252073866240).
171490214896 is an abundant number, since it is smaller than the sum of its proper divisors (332657517584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
171490214896 is a wasteful number, since it uses less digits than its factorization.
171490214896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163 (or 136 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 52.
The spelling of 171490214896 in words is "one hundred seventy-one billion, four hundred ninety million, two hundred fourteen thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •