Base | Representation |
---|---|
bin | 100000010100011011000101… |
… | …000000011001001111101100 |
3 | 200122021112122101212001102020 |
4 | 200110123011000121033230 |
5 | 122112314132421040110 |
6 | 1222150352522030140 |
7 | 41640226214533140 |
oct | 4024330500311754 |
9 | 618245571761366 |
10 | 142140952908780 |
11 | 41321704345691 |
12 | 13b37a51648350 |
13 | 6140ab00967b7 |
14 | 2715931b79220 |
15 | 116762bbb8d70 |
hex | 8146c50193ec |
142140952908780 has 96 divisors (see below), whose sum is σ = 457159938149376. Its totient is φ = 32324440033536.
The previous prime is 142140952908761. The next prime is 142140952908793. The reversal of 142140952908780 is 87809259041241.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 858878784 + ... + 859044263.
It is an arithmetic number, because the mean of its divisors is an integer number (4762082689056).
Almost surely, 2142140952908780 is an apocalyptic number.
142140952908780 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142140952908780 is an abundant number, since it is smaller than the sum of its proper divisors (315018985240596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142140952908780 is a wasteful number, since it uses less digits than its factorization.
142140952908780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1717923263 (or 1717923261 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 60.
The spelling of 142140952908780 in words is "one hundred forty-two trillion, one hundred forty billion, nine hundred fifty-two million, nine hundred eight thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •