Base | Representation |
---|---|
bin | 10001000000110… |
… | …11110010011000 |
3 | 100221112221020120 |
4 | 20200123302120 |
5 | 243014021102 |
6 | 22054553240 |
7 | 3352046511 |
oct | 1040336230 |
9 | 327487216 |
10 | 142720152 |
11 | 7361a843 |
12 | 3b968820 |
13 | 237504c3 |
14 | 14d51a08 |
15 | c7e26bc |
hex | 881bc98 |
142720152 has 32 divisors (see below), whose sum is σ = 372314880. Its totient is φ = 45504800.
The previous prime is 142720147. The next prime is 142720159. The reversal of 142720152 is 251027241.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142720159) 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 7 ways as a sum of consecutive naturals, for example, 128724 + ... + 129827.
It is an arithmetic number, because the mean of its divisors is an integer number (11634840).
Almost surely, 2142720152 is an apocalyptic number.
142720152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
142720152 is an abundant number, since it is smaller than the sum of its proper divisors (229594728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142720152 is a wasteful number, since it uses less digits than its factorization.
142720152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258583 (or 258579 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 24.
The square root of 142720152 is about 11946.5539801233. The cubic root of 142720152 is about 522.5908079925.
Adding to 142720152 its reverse (251027241), we get a palindrome (393747393).
The spelling of 142720152 in words is "one hundred forty-two million, seven hundred twenty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •