Base | Representation |
---|---|
bin | 10000111110101… |
… | …01001101111101 |
3 | 100221000020201222 |
4 | 20133111031331 |
5 | 242430243401 |
6 | 22044443125 |
7 | 3346434011 |
oct | 1037251575 |
9 | 327006658 |
10 | 142431101 |
11 | 7344265a |
12 | 3b8494a5 |
13 | 2367ba77 |
14 | 14cb8541 |
15 | c786c1b |
hex | 87d537d |
142431101 has 2 divisors, whose sum is σ = 142431102. Its totient is φ = 142431100.
The previous prime is 142431097. The next prime is 142431131. The reversal of 142431101 is 101134241.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130188100 + 12243001 = 11410^2 + 3499^2 .
It is a cyclic number.
It is not a de Polignac number, because 142431101 - 22 = 142431097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 142431101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142431131) 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 as a sum of consecutive naturals, namely, 71215550 + 71215551.
It is an arithmetic number, because the mean of its divisors is an integer number (71215551).
Almost surely, 2142431101 is an apocalyptic number.
It is an amenable number.
142431101 is a deficient number, since it is larger than the sum of its proper divisors (1).
142431101 is an equidigital number, since it uses as much as digits as its factorization.
142431101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 142431101 is about 11934.4501758564. The cubic root of 142431101 is about 522.2377686450.
Adding to 142431101 its reverse (101134241), we get a palindrome (243565342).
The spelling of 142431101 in words is "one hundred forty-two million, four hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •