Base | Representation |
---|---|
bin | 100000010110111001100010… |
… | …101001000111001000111101 |
3 | 200122212210211100010102011001 |
4 | 200112321202221013020331 |
5 | 122123111113420024411 |
6 | 1222400452321130301 |
7 | 41655431520334153 |
oct | 4026714251071075 |
9 | 618783740112131 |
10 | 142311101329981 |
11 | 41387887726901 |
12 | 13b64a17a89991 |
13 | 6153b579b8c7c |
14 | 271dc734093d3 |
15 | 116bc89580dc1 |
hex | 816e62a4723d |
142311101329981 has 2 divisors, whose sum is σ = 142311101329982. Its totient is φ = 142311101329980.
The previous prime is 142311101329907. The next prime is 142311101330033. The reversal of 142311101329981 is 189923101113241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139351910077081 + 2959191252900 = 11804741^2 + 1720230^2 .
It is a cyclic number.
It is not a de Polignac number, because 142311101329981 - 29 = 142311101329469 is a prime.
It is a super-2 number, since 2×1423111013299812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142311101359981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71155550664990 + 71155550664991.
It is an arithmetic number, because the mean of its divisors is an integer number (71155550664991).
Almost surely, 2142311101329981 is an apocalyptic number.
It is an amenable number.
142311101329981 is a deficient number, since it is larger than the sum of its proper divisors (1).
142311101329981 is an equidigital number, since it uses as much as digits as its factorization.
142311101329981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312, while the sum is 46.
The spelling of 142311101329981 in words is "one hundred forty-two trillion, three hundred eleven billion, one hundred one million, three hundred twenty-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •