Base | Representation |
---|---|
bin | 10010100111010… |
… | …111110011110111 |
3 | 210202200001012020 |
4 | 102213113303313 |
5 | 1114422423111 |
6 | 50553524223 |
7 | 10511412534 |
oct | 2247276367 |
9 | 722601166 |
10 | 312311031 |
11 | 15032299a |
12 | 88713673 |
13 | 4c91b536 |
14 | 2d699d8b |
15 | 1c641906 |
hex | 129d7cf7 |
312311031 has 8 divisors (see below), whose sum is σ = 416532864. Its totient is φ = 208148280.
The previous prime is 312310993. The next prime is 312311039. The reversal of 312311031 is 130113213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 312311031 - 26 = 312310967 is a prime.
It is a super-2 number, since 2×3123110312 = 195076360168565922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 312311031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312311039) 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 in 7 ways as a sum of consecutive naturals, for example, 451 + ... + 24996.
It is an arithmetic number, because the mean of its divisors is an integer number (52066608).
Almost surely, 2312311031 is an apocalyptic number.
312311031 is a deficient number, since it is larger than the sum of its proper divisors (104221833).
312311031 is a wasteful number, since it uses less digits than its factorization.
312311031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29541.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 312311031 is about 17672.3238709571. The cubic root of 312311031 is about 678.4675923596.
Adding to 312311031 its reverse (130113213), we get a palindrome (442424244).
The spelling of 312311031 in words is "three hundred twelve million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •