Base | Representation |
---|---|
bin | 1000010010100110101… |
… | …1101010100011100001 |
3 | 111121122102020221002102 |
4 | 2010221223222203201 |
5 | 4313200401424441 |
6 | 145233302300145 |
7 | 13201425335264 |
oct | 2045153524341 |
9 | 447572227072 |
10 | 142433233121 |
11 | 55450935203 |
12 | 23730727655 |
13 | 1057ba153ca |
14 | 6c7285ccdb |
15 | 3a8965e69b |
hex | 2129aea8e1 |
142433233121 has 2 divisors, whose sum is σ = 142433233122. Its totient is φ = 142433233120.
The previous prime is 142433233097. The next prime is 142433233133. The reversal of 142433233121 is 121332334241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138262010896 + 4171222225 = 371836^2 + 64585^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142433233121 is a prime.
It is a super-2 number, since 2×1424332331212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (142433233021) 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, 71216616560 + 71216616561.
It is an arithmetic number, because the mean of its divisors is an integer number (71216616561).
Almost surely, 2142433233121 is an apocalyptic number.
It is an amenable number.
142433233121 is a deficient number, since it is larger than the sum of its proper divisors (1).
142433233121 is an equidigital number, since it uses as much as digits as its factorization.
142433233121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 29.
Adding to 142433233121 its reverse (121332334241), we get a palindrome (263765567362).
The spelling of 142433233121 in words is "one hundred forty-two billion, four hundred thirty-three million, two hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •