Base | Representation |
---|---|
bin | 10000111100010… |
… | …01100001010000 |
3 | 100220102111102020 |
4 | 20132021201100 |
5 | 242340333130 |
6 | 22034051440 |
7 | 3344003025 |
oct | 1036114120 |
9 | 326374366 |
10 | 142121040 |
11 | 73250706 |
12 | 3b719b80 |
13 | 235a08b9 |
14 | 14c3754c |
15 | c724e10 |
hex | 8789850 |
142121040 has 80 divisors (see below), whose sum is σ = 441721728. Its totient is φ = 37800448.
The previous prime is 142121027. The next prime is 142121051. The reversal of 142121040 is 40121241.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 177922 + ... + 178718.
Almost surely, 2142121040 is an apocalyptic number.
142121040 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 142121040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (220860864).
142121040 is an abundant number, since it is smaller than the sum of its proper divisors (299600688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142121040 is a wasteful number, since it uses less digits than its factorization.
142121040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1556 (or 1550 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
The square root of 142121040 is about 11921.4529315851. The cubic root of 142121040 is about 521.8585368490.
Adding to 142121040 its reverse (40121241), we get a palindrome (182242281).
The spelling of 142121040 in words is "one hundred forty-two million, one hundred twenty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •