Base | Representation |
---|---|
bin | 1110001111110101000110… |
… | …01111100100000101111111 |
3 | 11002221010210121112122222201 |
4 | 13013322203033210011333 |
5 | 13101303302414120411 |
6 | 150344524205252331 |
7 | 6412351211622322 |
oct | 707724317440577 |
9 | 132833717478881 |
10 | 31330230223231 |
11 | 9a8a092202405 |
12 | 36200128640a7 |
13 | 1463574508534 |
14 | 7a456978c7b9 |
15 | 394e87b523c1 |
hex | 1c7ea33e417f |
31330230223231 has 2 divisors, whose sum is σ = 31330230223232. Its totient is φ = 31330230223230.
The previous prime is 31330230223163. The next prime is 31330230223241. The reversal of 31330230223231 is 13232203203313.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31330230223231 - 217 = 31330230092159 is a prime.
It is a super-2 number, since 2×313302302232312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31330230223231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31330230223241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15665115111615 + 15665115111616.
It is an arithmetic number, because the mean of its divisors is an integer number (15665115111616).
Almost surely, 231330230223231 is an apocalyptic number.
31330230223231 is a deficient number, since it is larger than the sum of its proper divisors (1).
31330230223231 is an equidigital number, since it uses as much as digits as its factorization.
31330230223231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 31330230223231 its reverse (13232203203313), we get a palindrome (44562433426544).
The spelling of 31330230223231 in words is "thirty-one trillion, three hundred thirty billion, two hundred thirty million, two hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •