Base | Representation |
---|---|
bin | 10000111101001… |
… | …00011110001001 |
3 | 100220122002211212 |
4 | 20132210132021 |
5 | 242402401213 |
6 | 22040302505 |
7 | 3344642621 |
oct | 1036443611 |
9 | 326562755 |
10 | 142231433 |
11 | 73316643 |
12 | 3b771a35 |
13 | 2360bc16 |
14 | 14c65881 |
15 | c7479a8 |
hex | 87a4789 |
142231433 has 2 divisors, whose sum is σ = 142231434. Its totient is φ = 142231432.
The previous prime is 142231423. The next prime is 142231451. The reversal of 142231433 is 334132241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99760144 + 42471289 = 9988^2 + 6517^2 .
It is an emirp because it is prime and its reverse (334132241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142231433 - 24 = 142231417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142231399 and 142231408.
It is not a weakly prime, because it can be changed into another prime (142231423) 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, 71115716 + 71115717.
It is an arithmetic number, because the mean of its divisors is an integer number (71115717).
Almost surely, 2142231433 is an apocalyptic number.
It is an amenable number.
142231433 is a deficient number, since it is larger than the sum of its proper divisors (1).
142231433 is an equidigital number, since it uses as much as digits as its factorization.
142231433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 23.
The square root of 142231433 is about 11926.0820473448. The cubic root of 142231433 is about 521.9936203426.
Adding to 142231433 its reverse (334132241), we get a palindrome (476363674).
The spelling of 142231433 in words is "one hundred forty-two million, two hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •