Base | Representation |
---|---|
bin | 1000010010110010101… |
… | …0000000100101000000 |
3 | 111121202220010222200110 |
4 | 2010230222000211000 |
5 | 4313301140140223 |
6 | 145242243551320 |
7 | 13202602425243 |
oct | 2045452004500 |
9 | 447686128613 |
10 | 142483130688 |
11 | 55477015a68 |
12 | 2374538b540 |
13 | 10589165cb2 |
14 | 6c7932b25a |
15 | 3a8dc18d93 |
hex | 212ca80940 |
142483130688 has 112 divisors (see below), whose sum is σ = 387818904320. Its totient is φ = 46133950464.
The previous prime is 142483130681. The next prime is 142483130689. The reversal of 142483130688 is 886031384241.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142483130681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4338393 + ... + 4371111.
Almost surely, 2142483130688 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 142483130688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193909452160).
142483130688 is an abundant number, since it is smaller than the sum of its proper divisors (245335773632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142483130688 is a wasteful number, since it uses less digits than its factorization.
142483130688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33384 (or 33374 counting only the distinct ones).
The product of its (nonzero) digits is 884736, while the sum is 48.
The spelling of 142483130688 in words is "one hundred forty-two billion, four hundred eighty-three million, one hundred thirty thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •