Base | Representation |
---|---|
bin | 10001000001100… |
… | …01110100100101 |
3 | 100221201112001021 |
4 | 20200301310211 |
5 | 243024413110 |
6 | 22100531141 |
7 | 3352603603 |
oct | 1040616445 |
9 | 327645037 |
10 | 142810405 |
11 | 73681631 |
12 | 3b9b0ab1 |
13 | 237825ca |
14 | 14d76873 |
15 | c80e2da |
hex | 8831d25 |
142810405 has 4 divisors (see below), whose sum is σ = 171372492. Its totient is φ = 114248320.
The previous prime is 142810399. The next prime is 142810429. The reversal of 142810405 is 504018241.
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 107205316 + 35605089 = 10354^2 + 5967^2 .
It is not a de Polignac number, because 142810405 - 25 = 142810373 is a prime.
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 142810405.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 14281036 + ... + 14281045.
It is an arithmetic number, because the mean of its divisors is an integer number (42843123).
Almost surely, 2142810405 is an apocalyptic number.
It is an amenable number.
142810405 is a deficient number, since it is larger than the sum of its proper divisors (28562087).
142810405 is an equidigital number, since it uses as much as digits as its factorization.
142810405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28562086.
The product of its (nonzero) digits is 1280, while the sum is 25.
The square root of 142810405 is about 11950.3307485609. The cubic root of 142810405 is about 522.7009429873.
Adding to 142810405 its reverse (504018241), we get a palindrome (646828646).
The spelling of 142810405 in words is "one hundred forty-two million, eight hundred ten thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •