Base | Representation |
---|---|
bin | 100000010011110110111011… |
… | …101101011010101101001101 |
3 | 200122010211110121201110121112 |
4 | 200103312323231122231031 |
5 | 122111200141402432141 |
6 | 1222120453430341405 |
7 | 41634353361326126 |
oct | 4023667355325515 |
9 | 618124417643545 |
10 | 142102142233421 |
11 | 413071a8771877 |
12 | 13b3041baba865 |
13 | 613a23653b636 |
14 | 2713acd51d04d |
15 | 116660980e7eb |
hex | 813dbbb5ab4d |
142102142233421 has 2 divisors, whose sum is σ = 142102142233422. Its totient is φ = 142102142233420.
The previous prime is 142102142233339. The next prime is 142102142233477. The reversal of 142102142233421 is 124332241201241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102620850738025 + 39481291495396 = 10130195^2 + 6283414^2 .
It is a cyclic number.
It is not a de Polignac number, because 142102142233421 - 210 = 142102142232397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142102142233021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71051071116710 + 71051071116711.
It is an arithmetic number, because the mean of its divisors is an integer number (71051071116711).
Almost surely, 2142102142233421 is an apocalyptic number.
It is an amenable number.
142102142233421 is a deficient number, since it is larger than the sum of its proper divisors (1).
142102142233421 is an equidigital number, since it uses as much as digits as its factorization.
142102142233421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 142102142233421 its reverse (124332241201241), we get a palindrome (266434383434662).
The spelling of 142102142233421 in words is "one hundred forty-two trillion, one hundred two billion, one hundred forty-two million, two hundred thirty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •