Base | Representation |
---|---|
bin | 100000010101011100011011… |
… | …111001111110101000010011 |
3 | 200122112020210012000222200121 |
4 | 200111130123321332220103 |
5 | 122114441343330241202 |
6 | 1222242520311331111 |
7 | 41645262244643626 |
oct | 4025343371765023 |
9 | 618466705028617 |
10 | 142211130321427 |
11 | 413494466a2482 |
12 | 13b49577980a97 |
13 | 61475b51ba43b |
14 | 27190ac173dbd |
15 | 1169387b71537 |
hex | 81571be7ea13 |
142211130321427 has 2 divisors, whose sum is σ = 142211130321428. Its totient is φ = 142211130321426.
The previous prime is 142211130321391. The next prime is 142211130321443. The reversal of 142211130321427 is 724123031112241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 142211130321427 - 215 = 142211130288659 is a prime.
It is a super-3 number, since 3×1422111303214273 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142211130321392 and 142211130321401.
It is not a weakly prime, because it can be changed into another prime (142211130325427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71105565160713 + 71105565160714.
It is an arithmetic number, because the mean of its divisors is an integer number (71105565160714).
Almost surely, 2142211130321427 is an apocalyptic number.
142211130321427 is a deficient number, since it is larger than the sum of its proper divisors (1).
142211130321427 is an equidigital number, since it uses as much as digits as its factorization.
142211130321427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 34.
Adding to 142211130321427 its reverse (724123031112241), we get a palindrome (866334161433668).
The spelling of 142211130321427 in words is "one hundred forty-two trillion, two hundred eleven billion, one hundred thirty million, three hundred twenty-one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •