Base | Representation |
---|---|
bin | 100000010101110000000100… |
… | …111101011111000001000111 |
3 | 200122121021012222100212200121 |
4 | 200111300010331133001013 |
5 | 122120313041332413111 |
6 | 1222300325132522411 |
7 | 41646640002653242 |
oct | 4025600475370107 |
9 | 618537188325617 |
10 | 142232220201031 |
11 | 41357389354144 |
12 | 13b51682920407 |
13 | 614959661143c |
14 | 271a10d0c2259 |
15 | 1169bbe424871 |
hex | 815c04f5f047 |
142232220201031 has 2 divisors, whose sum is σ = 142232220201032. Its totient is φ = 142232220201030.
The previous prime is 142232220201017. The next prime is 142232220201101. The reversal of 142232220201031 is 130102022232241.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 142232220201031 - 29 = 142232220200519 is a prime.
It is a super-2 number, since 2×1422322202010312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142232220200987 and 142232220201005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142232220201431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71116110100515 + 71116110100516.
It is an arithmetic number, because the mean of its divisors is an integer number (71116110100516).
Almost surely, 2142232220201031 is an apocalyptic number.
142232220201031 is a deficient number, since it is larger than the sum of its proper divisors (1).
142232220201031 is an equidigital number, since it uses as much as digits as its factorization.
142232220201031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 142232220201031 its reverse (130102022232241), we get a palindrome (272334242433272).
The spelling of 142232220201031 in words is "one hundred forty-two trillion, two hundred thirty-two billion, two hundred twenty million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •