Base | Representation |
---|---|
bin | 1000010100100100011… |
… | …1100001001101100100 |
3 | 111200000011122101122120 |
4 | 2011021013201031210 |
5 | 4320240410103310 |
6 | 145401502225540 |
7 | 13220461202340 |
oct | 2051107411544 |
9 | 450004571576 |
10 | 142960628580 |
11 | 556a1603220 |
12 | 238592852b0 |
13 | 1063406cb23 |
14 | 6cc2906620 |
15 | 3abaad9b70 |
hex | 21491e1364 |
142960628580 has 768 divisors, whose sum is σ = 553816424448. Its totient is φ = 26643456000.
The previous prime is 142960628579. The next prime is 142960628633. The reversal of 142960628580 is 85826069241.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 172866127 + ... + 172866953.
It is an arithmetic number, because the mean of its divisors is an integer number (721115136).
Almost surely, 2142960628580 is an apocalyptic number.
142960628580 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 142960628580, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (276908212224).
142960628580 is an abundant number, since it is smaller than the sum of its proper divisors (410855795868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142960628580 is a wasteful number, since it uses less digits than its factorization.
142960628580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 976 (or 974 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 51.
The spelling of 142960628580 in words is "one hundred forty-two billion, nine hundred sixty million, six hundred twenty-eight thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •