Base | Representation |
---|---|
bin | 1000010010100100111… |
… | …0000000000000000000 |
3 | 111121121212121211202121 |
4 | 2010221032000000000 |
5 | 4313141404103030 |
6 | 145232423454024 |
7 | 13201302256315 |
oct | 2045116000000 |
9 | 447555554677 |
10 | 142425456640 |
11 | 55447503665 |
12 | 23729bb7314 |
13 | 1057a22193c |
14 | 6c717d6d0c |
15 | 3a88b2547a |
hex | 2129380000 |
142425456640 has 80 divisors (see below), whose sum is σ = 341827061400. Its totient is φ = 56969134080.
The previous prime is 142425456571. The next prime is 142425456653. The reversal of 142425456640 is 46654524241.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1424254566402 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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, 2594275 + ... + 2648605.
Almost surely, 2142425456640 is an apocalyptic number.
142425456640 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 142425456640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170913530700).
142425456640 is an abundant number, since it is smaller than the sum of its proper divisors (199401604760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142425456640 is an frugal number, since it uses more digits than its factorization.
142425456640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54374 (or 54338 counting only the distinct ones).
The product of its (nonzero) digits is 921600, while the sum is 43.
The spelling of 142425456640 in words is "one hundred forty-two billion, four hundred twenty-five million, four hundred fifty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •