Base | Representation |
---|---|
bin | 1110010011000011110100… |
… | …01010010110110110000001 |
3 | 11010022202020222211200022112 |
4 | 13021201322022112312001 |
5 | 13110113044244021311 |
6 | 150511520442145105 |
7 | 6423360332436125 |
oct | 711417212266601 |
9 | 133282228750275 |
10 | 31441210142081 |
11 | a022162500003 |
12 | 36396257b2195 |
13 | 1470b7ca3127c |
14 | 7a9a96b73585 |
15 | 397cd0cb128b |
hex | 1c987a296d81 |
31441210142081 has 2 divisors, whose sum is σ = 31441210142082. Its totient is φ = 31441210142080.
The previous prime is 31441210142071. The next prime is 31441210142131. The reversal of 31441210142081 is 18024101214413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28614036925681 + 2827173216400 = 5349209^2 + 1681420^2 .
It is a cyclic number.
It is not a de Polignac number, because 31441210142081 - 214 = 31441210125697 is a prime.
It is a super-2 number, since 2×314412101420812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31441210142011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15720605071040 + 15720605071041.
It is an arithmetic number, because the mean of its divisors is an integer number (15720605071041).
Almost surely, 231441210142081 is an apocalyptic number.
It is an amenable number.
31441210142081 is a deficient number, since it is larger than the sum of its proper divisors (1).
31441210142081 is an equidigital number, since it uses as much as digits as its factorization.
31441210142081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 32.
Adding to 31441210142081 its reverse (18024101214413), we get a palindrome (49465311356494).
The spelling of 31441210142081 in words is "thirty-one trillion, four hundred forty-one billion, two hundred ten million, one hundred forty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •