Base | Representation |
---|---|
bin | 1110010001111001010100… |
… | …00110011110000011110001 |
3 | 11010011221000110201201202221 |
4 | 13020330222012132003301 |
5 | 13103434140313140423 |
6 | 150441303500241041 |
7 | 6420443212044052 |
oct | 710745206360361 |
9 | 133157013651687 |
10 | 31401212240113 |
11 | a0071a7755281 |
12 | 3631922540181 |
13 | 146a177234961 |
14 | 7a7b80990729 |
15 | 396c3e590e5d |
hex | 1c8f2a19e0f1 |
31401212240113 has 2 divisors, whose sum is σ = 31401212240114. Its totient is φ = 31401212240112.
The previous prime is 31401212240081. The next prime is 31401212240143. The reversal of 31401212240113 is 31104221210413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30934876219569 + 466336020544 = 5561913^2 + 682888^2 .
It is a cyclic number.
It is not a de Polignac number, because 31401212240113 - 25 = 31401212240081 is a prime.
It is a super-2 number, since 2×314012122401132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31401212240143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15700606120056 + 15700606120057.
It is an arithmetic number, because the mean of its divisors is an integer number (15700606120057).
Almost surely, 231401212240113 is an apocalyptic number.
It is an amenable number.
31401212240113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31401212240113 is an equidigital number, since it uses as much as digits as its factorization.
31401212240113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 31401212240113 its reverse (31104221210413), we get a palindrome (62505433450526).
The spelling of 31401212240113 in words is "thirty-one trillion, four hundred one billion, two hundred twelve million, two hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •