Base | Representation |
---|---|
bin | 10000111111001… |
… | …11010010100000 |
3 | 100221011000021102 |
4 | 20133213102200 |
5 | 242440130440 |
6 | 22050213532 |
7 | 3350162552 |
oct | 1037472240 |
9 | 327130242 |
10 | 142505120 |
11 | 7349322a |
12 | 3b8842a8 |
13 | 236a6674 |
14 | 14cd74d2 |
15 | c79db15 |
hex | 87e74a0 |
142505120 has 24 divisors (see below), whose sum is σ = 336668724. Its totient is φ = 57001984.
The previous prime is 142505113. The next prime is 142505123. The reversal of 142505120 is 21505241.
It can be written as a sum of positive squares in 2 ways, for example, as 142372624 + 132496 = 11932^2 + 364^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 142505092 and 142505101.
It is not an unprimeable number, because it can be changed into a prime (142505123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 445169 + ... + 445488.
Almost surely, 2142505120 is an apocalyptic number.
142505120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142505120 is an abundant number, since it is smaller than the sum of its proper divisors (194163604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142505120 is an equidigital number, since it uses as much as digits as its factorization.
142505120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890672 (or 890664 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 142505120 is about 11937.5508375881. The cubic root of 142505120 is about 522.3282189817.
The spelling of 142505120 in words is "one hundred forty-two million, five hundred five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •