Base | Representation |
---|---|
bin | 1110001100111100110111… |
… | …01111110011101101000001 |
3 | 11002120200111101220101211021 |
4 | 13012132123233303231001 |
5 | 13043143220433211431 |
6 | 150231245340345441 |
7 | 6402250141444444 |
oct | 706363357635501 |
9 | 132520441811737 |
10 | 31231320210241 |
11 | 9a51146072718 |
12 | 3604a09b45281 |
13 | 1457140782028 |
14 | 79d8653c165b |
15 | 3925e9471b11 |
hex | 1c679bbf3b41 |
31231320210241 has 2 divisors, whose sum is σ = 31231320210242. Its totient is φ = 31231320210240.
The previous prime is 31231320210163. The next prime is 31231320210253. The reversal of 31231320210241 is 14201202313213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29405903043841 + 1825417166400 = 5422721^2 + 1351080^2 .
It is an emirp because it is prime and its reverse (14201202313213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31231320210241 - 27 = 31231320210113 is a prime.
It is not a weakly prime, because it can be changed into another prime (31231320210271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15615660105120 + 15615660105121.
It is an arithmetic number, because the mean of its divisors is an integer number (15615660105121).
Almost surely, 231231320210241 is an apocalyptic number.
It is an amenable number.
31231320210241 is a deficient number, since it is larger than the sum of its proper divisors (1).
31231320210241 is an equidigital number, since it uses as much as digits as its factorization.
31231320210241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 31231320210241 its reverse (14201202313213), we get a palindrome (45432522523454).
The spelling of 31231320210241 in words is "thirty-one trillion, two hundred thirty-one billion, three hundred twenty million, two hundred ten thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •