Base | Representation |
---|---|
bin | 10010101101110… |
… | …100111001010111 |
3 | 210212212000011220 |
4 | 102231310321113 |
5 | 1120341044111 |
6 | 51054101423 |
7 | 10531660506 |
oct | 2255647127 |
9 | 725760156 |
10 | 314003031 |
11 | 151279141 |
12 | 891aa873 |
13 | 50091714 |
14 | 2d9ba83d |
15 | 1c877e06 |
hex | 12b74e57 |
314003031 has 8 divisors (see below), whose sum is σ = 419858160. Its totient is φ = 208741632.
The previous prime is 314003009. The next prime is 314003033. The reversal of 314003031 is 130300413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 314003031 - 211 = 314000983 is a prime.
It is a super-2 number, since 2×3140030312 = 197195806954373922, 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 314003031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314003033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 147196 + ... + 149313.
It is an arithmetic number, because the mean of its divisors is an integer number (52482270).
Almost surely, 2314003031 is an apocalyptic number.
314003031 is a deficient number, since it is larger than the sum of its proper divisors (105855129).
314003031 is a wasteful number, since it uses less digits than its factorization.
314003031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296865.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 314003031 is about 17720.1306710758. The cubic root of 314003031 is about 679.6906255594.
Adding to 314003031 its reverse (130300413), we get a palindrome (444303444).
The spelling of 314003031 in words is "three hundred fourteen million, three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •