Base | Representation |
---|---|
bin | 10000111100001… |
… | …00011110110101 |
3 | 100220101110002222 |
4 | 20132010132311 |
5 | 242334203110 |
6 | 22033412125 |
7 | 3343555616 |
oct | 1036043665 |
9 | 326343088 |
10 | 142100405 |
11 | 73237157 |
12 | 3b70a045 |
13 | 235943a5 |
14 | 14c2dc0d |
15 | c71dc55 |
hex | 87847b5 |
142100405 has 4 divisors (see below), whose sum is σ = 170520492. Its totient is φ = 113680320.
The previous prime is 142100393. The next prime is 142100407. The reversal of 142100405 is 504001241.
142100405 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 56685841 + 85414564 = 7529^2 + 9242^2 .
It is not a de Polignac number, because 142100405 - 24 = 142100389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142100407) 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, 14210036 + ... + 14210045.
It is an arithmetic number, because the mean of its divisors is an integer number (42630123).
Almost surely, 2142100405 is an apocalyptic number.
It is an amenable number.
142100405 is a deficient number, since it is larger than the sum of its proper divisors (28420087).
142100405 is an equidigital number, since it uses as much as digits as its factorization.
142100405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28420086.
The product of its (nonzero) digits is 160, while the sum is 17.
The square root of 142100405 is about 11920.5874435784. The cubic root of 142100405 is about 521.8332788668.
Adding to 142100405 its reverse (504001241), we get a palindrome (646101646).
The spelling of 142100405 in words is "one hundred forty-two million, one hundred thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •