Base | Representation |
---|---|
bin | 1000100101010110101… |
… | …1010001100110000000 |
3 | 112002122011211222221211 |
4 | 2021111223101212000 |
5 | 4404002332430210 |
6 | 151424534255504 |
7 | 13440231555124 |
oct | 2112553214600 |
9 | 462564758854 |
10 | 147466295680 |
11 | 575a3974640 |
12 | 246b61b7594 |
13 | 10ba167bc32 |
14 | 71cd089584 |
15 | 3c8144738a |
hex | 2255ad1980 |
147466295680 has 384 divisors, whose sum is σ = 404301300480. Its totient is φ = 50996736000.
The previous prime is 147466295671. The next prime is 147466295681. The reversal of 147466295680 is 86592664741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147466295681) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 480346087 + ... + 480346393.
It is an arithmetic number, because the mean of its divisors is an integer number (1052867970).
Almost surely, 2147466295680 is an apocalyptic number.
147466295680 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 147466295680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202150650240).
147466295680 is an abundant number, since it is smaller than the sum of its proper divisors (256835004800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147466295680 is a wasteful number, since it uses less digits than its factorization.
147466295680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470 (or 427 counting only the distinct ones).
The product of its (nonzero) digits is 17418240, while the sum is 58.
The spelling of 147466295680 in words is "one hundred forty-seven billion, four hundred sixty-six million, two hundred ninety-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •