Base | Representation |
---|---|
bin | 1000010010111011111… |
… | …0111001101110000010 |
3 | 111121212121120222122110 |
4 | 2010232332321232002 |
5 | 4313341133141200 |
6 | 145250200320150 |
7 | 13203555250302 |
oct | 2045676715602 |
9 | 447777528573 |
10 | 142522162050 |
11 | 55497054894 |
12 | 23756473056 |
13 | 10594280988 |
14 | 6c805ab602 |
15 | 3a92378b50 |
hex | 212efb9b82 |
142522162050 has 48 divisors (see below), whose sum is σ = 354522925152. Its totient is φ = 37891075200.
The previous prime is 142522162001. The next prime is 142522162051. The reversal of 142522162050 is 50261225241.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 142522161999 and 142522162017.
It is not an unprimeable number, because it can be changed into a prime (142522162051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1385619 + ... + 1484918.
It is an arithmetic number, because the mean of its divisors is an integer number (7385894274).
Almost surely, 2142522162050 is an apocalyptic number.
142522162050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
142522162050 is an abundant number, since it is smaller than the sum of its proper divisors (212000763102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142522162050 is a wasteful number, since it uses less digits than its factorization.
142522162050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2870883 (or 2870878 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 142522162050 its reverse (50261225241), we get a palindrome (192783387291).
The spelling of 142522162050 in words is "one hundred forty-two billion, five hundred twenty-two million, one hundred sixty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •