Base | Representation |
---|---|
bin | 1000011101111011001… |
… | …0010111100000000000 |
3 | 111220111011121022200000 |
4 | 2013132302113200000 |
5 | 4340411221304201 |
6 | 150455002400000 |
7 | 13336631521554 |
oct | 2073662274000 |
9 | 456434538600 |
10 | 145471666176 |
11 | 5676aa65a01 |
12 | 2423a200000 |
13 | 109443651a5 |
14 | 70801cb864 |
15 | 3bb6295d86 |
hex | 21dec97800 |
145471666176 has 144 divisors (see below), whose sum is σ = 435711439800. Its totient is φ = 48490389504.
The previous prime is 145471666169. The next prime is 145471666211. The reversal of 145471666176 is 671666174541.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 351510 + ... + 643818.
Almost surely, 2145471666176 is an apocalyptic number.
145471666176 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 145471666176, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (217855719900).
145471666176 is an abundant number, since it is smaller than the sum of its proper divisors (290239773624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145471666176 is an frugal number, since it uses more digits than its factorization.
145471666176 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292346 (or 292314 counting only the distinct ones).
The product of its digits is 5080320, while the sum is 54.
The spelling of 145471666176 in words is "one hundred forty-five billion, four hundred seventy-one million, six hundred sixty-six thousand, one hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •