Base | Representation |
---|---|
bin | 10000111110100… |
… | …11100001011001 |
3 | 100220222220012122 |
4 | 20133103201121 |
5 | 242430033103 |
6 | 22044351025 |
7 | 3346404524 |
oct | 1037234131 |
9 | 326886178 |
10 | 142424153 |
11 | 73438413 |
12 | 3b845475 |
13 | 23678861 |
14 | 14cb5bbb |
15 | c784b38 |
hex | 87d3859 |
142424153 has 4 divisors (see below), whose sum is σ = 143247588. Its totient is φ = 141600720.
The previous prime is 142424141. The next prime is 142424159. The reversal of 142424153 is 351424241.
142424153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 127961344 + 14462809 = 11312^2 + 3803^2 .
It is a cyclic number.
It is not a de Polignac number, because 142424153 - 26 = 142424089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142424159) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 411458 + ... + 411803.
It is an arithmetic number, because the mean of its divisors is an integer number (35811897).
Almost surely, 2142424153 is an apocalyptic number.
It is an amenable number.
142424153 is a deficient number, since it is larger than the sum of its proper divisors (823435).
142424153 is an equidigital number, since it uses as much as digits as its factorization.
142424153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 823434.
The product of its digits is 3840, while the sum is 26.
The square root of 142424153 is about 11934.1590822311. The cubic root of 142424153 is about 522.2292766631.
Adding to 142424153 its reverse (351424241), we get a palindrome (493848394).
The spelling of 142424153 in words is "one hundred forty-two million, four hundred twenty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •