Base | Representation |
---|---|
bin | 10000111110100… |
… | …11010001010001 |
3 | 100220222211210102 |
4 | 20133103101101 |
5 | 242430014441 |
6 | 22044342145 |
7 | 3346401521 |
oct | 1037232121 |
9 | 326884712 |
10 | 142423121 |
11 | 73437665 |
12 | 3b844955 |
13 | 23678249 |
14 | 14cb5681 |
15 | c78469b |
hex | 87d3451 |
142423121 has 2 divisors, whose sum is σ = 142423122. Its totient is φ = 142423120.
The previous prime is 142423117. The next prime is 142423123. The reversal of 142423121 is 121324241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120670225 + 21752896 = 10985^2 + 4664^2 .
It is a cyclic number.
It is not a de Polignac number, because 142423121 - 22 = 142423117 is a prime.
Together with 142423123, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 142423093 and 142423102.
It is not a weakly prime, because it can be changed into another prime (142423123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71211560 + 71211561.
It is an arithmetic number, because the mean of its divisors is an integer number (71211561).
Almost surely, 2142423121 is an apocalyptic number.
It is an amenable number.
142423121 is a deficient number, since it is larger than the sum of its proper divisors (1).
142423121 is an equidigital number, since it uses as much as digits as its factorization.
142423121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 384, while the sum is 20.
The square root of 142423121 is about 11934.1158449212. The cubic root of 142423121 is about 522.2280153089.
Adding to 142423121 its reverse (121324241), we get a palindrome (263747362).
The spelling of 142423121 in words is "one hundred forty-two million, four hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •