Base | Representation |
---|---|
bin | 1000010001111101011… |
… | …1101000111000011111 |
3 | 111121012100200111200021 |
4 | 2010133113220320133 |
5 | 4312322103224411 |
6 | 145204202013011 |
7 | 13164224562265 |
oct | 2043727507037 |
9 | 447170614607 |
10 | 142260211231 |
11 | 553721a9306 |
12 | 236a27a7167 |
13 | 10551c157a8 |
14 | 6c578a0435 |
15 | 3a79383a71 |
hex | 211f5e8e1f |
142260211231 has 2 divisors, whose sum is σ = 142260211232. Its totient is φ = 142260211230.
The previous prime is 142260211213. The next prime is 142260211307. The reversal of 142260211231 is 132112062241.
Together with previous prime (142260211213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 142260211231 - 213 = 142260203039 is a prime.
It is a super-2 number, since 2×1422602112312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142260211196 and 142260211205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142260211211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71130105615 + 71130105616.
It is an arithmetic number, because the mean of its divisors is an integer number (71130105616).
Almost surely, 2142260211231 is an apocalyptic number.
142260211231 is a deficient number, since it is larger than the sum of its proper divisors (1).
142260211231 is an equidigital number, since it uses as much as digits as its factorization.
142260211231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 142260211231 its reverse (132112062241), we get a palindrome (274372273472).
The spelling of 142260211231 in words is "one hundred forty-two billion, two hundred sixty million, two hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •