Base | Representation |
---|---|
bin | 10010101110101… |
… | …111100011101111 |
3 | 210220022012210011 |
4 | 102232233203233 |
5 | 1120421241221 |
6 | 51103154051 |
7 | 10534011154 |
oct | 2256574357 |
9 | 726265704 |
10 | 314243311 |
11 | 151422718 |
12 | 892a5927 |
13 | 50146bb5 |
14 | 2da4022b |
15 | 1c8c41e1 |
hex | 12baf8ef |
314243311 has 8 divisors (see below), whose sum is σ = 332293248. Its totient is φ = 296688000.
The previous prime is 314243297. The next prime is 314243341. The reversal of 314243311 is 113342413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 314243311 - 225 = 280688879 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314243341) 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, 122350 + ... + 124891.
It is an arithmetic number, because the mean of its divisors is an integer number (41536656).
Almost surely, 2314243311 is an apocalyptic number.
314243311 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
314243311 is a deficient number, since it is larger than the sum of its proper divisors (18049937).
314243311 is a wasteful number, since it uses less digits than its factorization.
314243311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247313.
The product of its digits is 864, while the sum is 22.
The square root of 314243311 is about 17726.9092342687. The cubic root of 314243311 is about 679.8639513002.
Adding to 314243311 its reverse (113342413), we get a palindrome (427585724).
The spelling of 314243311 in words is "three hundred fourteen million, two hundred forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •