Base | Representation |
---|---|
bin | 111100000101… |
… | …1101110100001 |
3 | 2012021122011110 |
4 | 1320023232201 |
5 | 31031132223 |
6 | 3043133533 |
7 | 531535140 |
oct | 170135641 |
9 | 65248143 |
10 | 31505313 |
11 | 16869454 |
12 | a6742a9 |
13 | 66b11c8 |
14 | 4281757 |
15 | 2b74d93 |
hex | 1e0bba1 |
31505313 has 16 divisors (see below), whose sum is σ = 48087936. Its totient is φ = 17973120.
The previous prime is 31505303. The next prime is 31505321. The reversal of 31505313 is 31350513.
It is a happy number.
It is not a de Polignac number, because 31505313 - 24 = 31505297 is a prime.
It is a super-4 number, since 4×315053134 (a number of 31 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 31505313.
It is not an unprimeable number, because it can be changed into a prime (31505303) 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 in 15 ways as a sum of consecutive naturals, for example, 20533 + ... + 22013.
It is an arithmetic number, because the mean of its divisors is an integer number (3005496).
Almost surely, 231505313 is an apocalyptic number.
It is an amenable number.
31505313 is a deficient number, since it is larger than the sum of its proper divisors (16582623).
31505313 is a wasteful number, since it uses less digits than its factorization.
31505313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2504.
The product of its (nonzero) digits is 675, while the sum is 21.
The square root of 31505313 is about 5612.9593798637. The cubic root of 31505313 is about 315.8357348733.
Adding to 31505313 its reverse (31350513), we get a palindrome (62855826).
The spelling of 31505313 in words is "thirty-one million, five hundred five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •