Base | Representation |
---|---|
bin | 1000010001100001010… |
… | …1000101001010101100 |
3 | 111120220010102211201102 |
4 | 2010120111011022230 |
5 | 4312101334201030 |
6 | 145144342302232 |
7 | 13161261626135 |
oct | 2043025051254 |
9 | 446803384642 |
10 | 142142100140 |
11 | 55311567737 |
12 | 2366b127978 |
13 | 10533600581 |
14 | 6c45d16c8c |
15 | 3a6dd02c45 |
hex | 21185452ac |
142142100140 has 12 divisors (see below), whose sum is σ = 298498410336. Its totient is φ = 56856840048.
The previous prime is 142142100137. The next prime is 142142100179. The reversal of 142142100140 is 41001241241.
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 7107105007 = 142142100140 / (1 + 4 + 2 + 1 + 4 + 2 + 1 + 0 + 0 + 1 + 4 + 0).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3553552484 + ... + 3553552523.
It is an arithmetic number, because the mean of its divisors is an integer number (24874867528).
Almost surely, 2142142100140 is an apocalyptic number.
142142100140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142142100140 is an abundant number, since it is smaller than the sum of its proper divisors (156356310196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142142100140 is a wasteful number, since it uses less digits than its factorization.
142142100140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7107105016 (or 7107105014 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 142142100140 its reverse (41001241241), we get a palindrome (183143341381).
The spelling of 142142100140 in words is "one hundred forty-two billion, one hundred forty-two million, one hundred thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •