Base | Representation |
---|---|
bin | 11101010101010011… |
… | …101101001100011001 |
3 | 10000022000021120221221 |
4 | 131111103231030121 |
5 | 1004000434002111 |
6 | 22245152332041 |
7 | 2163333404464 |
oct | 352523551431 |
9 | 100260246857 |
10 | 31496000281 |
11 | 123a27421a9 |
12 | 612bb44021 |
13 | 2c7c2b6975 |
14 | 174adca2db |
15 | c45133371 |
hex | 7554ed319 |
31496000281 has 2 divisors, whose sum is σ = 31496000282. Its totient is φ = 31496000280.
The previous prime is 31496000257. The next prime is 31496000293. The reversal of 31496000281 is 18200069413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19763861056 + 11732139225 = 140584^2 + 108315^2 .
It is a cyclic number.
It is not a de Polignac number, because 31496000281 - 215 = 31495967513 is a prime.
It is a super-2 number, since 2×314960002812 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31496007281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15748000140 + 15748000141.
It is an arithmetic number, because the mean of its divisors is an integer number (15748000141).
Almost surely, 231496000281 is an apocalyptic number.
31496000281 is the 79368-th centered decagonal number.
It is an amenable number.
31496000281 is a deficient number, since it is larger than the sum of its proper divisors (1).
31496000281 is an equidigital number, since it uses as much as digits as its factorization.
31496000281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 34.
Adding to 31496000281 its reverse (18200069413), we get a palindrome (49696069694).
The spelling of 31496000281 in words is "thirty-one billion, four hundred ninety-six million, two hundred eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •