Base | Representation |
---|---|
bin | 10000111111010… |
… | …11001100111011 |
3 | 100221011211021000 |
4 | 20133223030323 |
5 | 242441134042 |
6 | 22050420043 |
7 | 3350260356 |
oct | 1037531473 |
9 | 327154230 |
10 | 142521147 |
11 | 734a427a |
12 | 3b891623 |
13 | 236b0a52 |
14 | 14cdd29d |
15 | c7a374c |
hex | 87eb33b |
142521147 has 32 divisors (see below), whose sum is σ = 223155200. Its totient is φ = 89649504.
The previous prime is 142521139. The next prime is 142521157. The reversal of 142521147 is 741125241.
It is not a de Polignac number, because 142521147 - 23 = 142521139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 142521147.
It is not an unprimeable number, because it can be changed into a prime (142521157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 187893 + ... + 188649.
It is an arithmetic number, because the mean of its divisors is an integer number (6973600).
Almost surely, 2142521147 is an apocalyptic number.
142521147 is a deficient number, since it is larger than the sum of its proper divisors (80634053).
142521147 is a wasteful number, since it uses less digits than its factorization.
142521147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152 (or 1146 counting only the distinct ones).
The product of its digits is 2240, while the sum is 27.
The square root of 142521147 is about 11938.2221038143. Note that the first 3 decimals coincide. The cubic root of 142521147 is about 522.3477996596.
Adding to 142521147 its reverse (741125241), we get a palindrome (883646388).
The spelling of 142521147 in words is "one hundred forty-two million, five hundred twenty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •