Base | Representation |
---|---|
bin | 110100100100110110111101… |
… | …011010010010110011010011 |
3 | 1010022201111111002220120220102 |
4 | 310210312331122102303103 |
5 | 220301443232004220311 |
6 | 2135442112453003015 |
7 | 66463624653126212 |
oct | 6444667532226323 |
9 | 1108644432816812 |
10 | 231231332101331 |
11 | 6774a725867a11 |
12 | 21b2622132346b |
13 | 9c04037345453 |
14 | 411592881d079 |
15 | 1baecce5ae43b |
hex | d24dbd692cd3 |
231231332101331 has 2 divisors, whose sum is σ = 231231332101332. Its totient is φ = 231231332101330.
The previous prime is 231231332101309. The next prime is 231231332101369. The reversal of 231231332101331 is 133101233132132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 231231332101331 - 214 = 231231332084947 is a prime.
It is a super-2 number, since 2×2312313321013312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231231332101294 and 231231332101303.
It is not a weakly prime, because it can be changed into another prime (231231332109331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115615666050665 + 115615666050666.
It is an arithmetic number, because the mean of its divisors is an integer number (115615666050666).
Almost surely, 2231231332101331 is an apocalyptic number.
231231332101331 is a deficient number, since it is larger than the sum of its proper divisors (1).
231231332101331 is an equidigital number, since it uses as much as digits as its factorization.
231231332101331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 231231332101331 its reverse (133101233132132), we get a palindrome (364332565233463).
The spelling of 231231332101331 in words is "two hundred thirty-one trillion, two hundred thirty-one billion, three hundred thirty-two million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •