Base | Representation |
---|---|
bin | 111100101100… |
… | …0111000000001 |
3 | 2012212200122011 |
4 | 1321120320001 |
5 | 31121240223 |
6 | 3054012521 |
7 | 534322336 |
oct | 171307001 |
9 | 65780564 |
10 | 31821313 |
11 | 16a64907 |
12 | a7a7141 |
13 | 6791ca4 |
14 | 432498d |
15 | 2bd880d |
hex | 1e58e01 |
31821313 has 2 divisors, whose sum is σ = 31821314. Its totient is φ = 31821312.
The previous prime is 31821311. The next prime is 31821319. The reversal of 31821313 is 31312813.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29235649 + 2585664 = 5407^2 + 1608^2 .
It is a cyclic number.
It is not a de Polignac number, because 31821313 - 21 = 31821311 is a prime.
It is a super-2 number, since 2×318213132 = 2025191922087938, which contains 22 as substring.
Together with 31821311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (31821311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15910656 + 15910657.
It is an arithmetic number, because the mean of its divisors is an integer number (15910657).
Almost surely, 231821313 is an apocalyptic number.
It is an amenable number.
31821313 is a deficient number, since it is larger than the sum of its proper divisors (1).
31821313 is an equidigital number, since it uses as much as digits as its factorization.
31821313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432, while the sum is 22.
The square root of 31821313 is about 5641.0382909532. The cubic root of 31821313 is about 316.8881738600. Note that the first 3 decimals are identical.
Subtracting from 31821313 its product of digits (432), we obtain a square (31820881 = 56412).
The spelling of 31821313 in words is "thirty-one million, eight hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •