Base | Representation |
---|---|
bin | 111100011001… |
… | …0001110100101 |
3 | 2012120122111012 |
4 | 1320302032211 |
5 | 31101204023 |
6 | 3050352005 |
7 | 533062664 |
oct | 170621645 |
9 | 65518435 |
10 | 31663013 |
11 | 16966988 |
12 | a72b605 |
13 | 6737c15 |
14 | 42c2ddb |
15 | 2ba6978 |
hex | 1e323a5 |
31663013 has 2 divisors, whose sum is σ = 31663014. Its totient is φ = 31663012.
The previous prime is 31663003. The next prime is 31663057. The reversal of 31663013 is 31036613.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29235649 + 2427364 = 5407^2 + 1558^2 .
It is a cyclic number.
It is not a de Polignac number, because 31663013 - 218 = 31400869 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 31663013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31663003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15831506 + 15831507.
It is an arithmetic number, because the mean of its divisors is an integer number (15831507).
Almost surely, 231663013 is an apocalyptic number.
It is an amenable number.
31663013 is a deficient number, since it is larger than the sum of its proper divisors (1).
31663013 is an equidigital number, since it uses as much as digits as its factorization.
31663013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
The square root of 31663013 is about 5626.9896925443. The cubic root of 31663013 is about 316.3618305000.
Adding to 31663013 its reverse (31036613), we get a palindrome (62699626).
The spelling of 31663013 in words is "thirty-one million, six hundred sixty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •