Base | Representation |
---|---|
bin | 1000010010101010110… |
… | …0100111100011111000 |
3 | 111121200121021222212120 |
4 | 2010222230213203320 |
5 | 4313214231311331 |
6 | 145235111241240 |
7 | 13202023143045 |
oct | 2045254474370 |
9 | 447617258776 |
10 | 142450260216 |
11 | 5545a504990 |
12 | 23736379220 |
13 | 105823c7604 |
14 | 6c74c121cc |
15 | 3a8adc4796 |
hex | 212ab278f8 |
142450260216 has 128 divisors (see below), whose sum is σ = 393443343360. Its totient is φ = 42619968000.
The previous prime is 142450260193. The next prime is 142450260263. The reversal of 142450260216 is 612062054241.
It is a super-2 number, since 2×1424502602162 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9778410 + ... + 9792966.
It is an arithmetic number, because the mean of its divisors is an integer number (3073776120).
Almost surely, 2142450260216 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 142450260216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196721671680).
142450260216 is an abundant number, since it is smaller than the sum of its proper divisors (250993083144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142450260216 is a wasteful number, since it uses less digits than its factorization.
142450260216 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15045 (or 15041 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
The spelling of 142450260216 in words is "one hundred forty-two billion, four hundred fifty million, two hundred sixty thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •