Base | Representation |
---|---|
bin | 1000010010101010110… |
… | …1100101000011111101 |
3 | 111121200121202210102112 |
4 | 2010222231211003331 |
5 | 4313214312342000 |
6 | 145235120503405 |
7 | 13202025242345 |
oct | 2045255450375 |
9 | 447617683375 |
10 | 142450512125 |
11 | 5545a667179 |
12 | 2373647ab65 |
13 | 1058248517c |
14 | 6c74c79d25 |
15 | 3a8ae24235 |
hex | 212ab650fd |
142450512125 has 64 divisors (see below), whose sum is σ = 194884185600. Its totient is φ = 103541760000.
The previous prime is 142450512119. The next prime is 142450512137. The reversal of 142450512125 is 521215054241.
142450512125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 142450512125 - 210 = 142450511101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142450512091 and 142450512100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10393277 + ... + 10406973.
It is an arithmetic number, because the mean of its divisors is an integer number (3045065400).
Almost surely, 2142450512125 is an apocalyptic number.
It is an amenable number.
142450512125 is a deficient number, since it is larger than the sum of its proper divisors (52433673475).
142450512125 is a wasteful number, since it uses less digits than its factorization.
142450512125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13911 (or 13901 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 32.
Adding to 142450512125 its reverse (521215054241), we get a palindrome (663665566366).
The spelling of 142450512125 in words is "one hundred forty-two billion, four hundred fifty million, five hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •