Base | Representation |
---|---|
bin | 10010101110101… |
… | …100010111001111 |
3 | 210220021112211102 |
4 | 102232230113033 |
5 | 1120420331343 |
6 | 51103013315 |
7 | 10533625046 |
oct | 2256542717 |
9 | 726245742 |
10 | 314230223 |
11 | 1514138aa |
12 | 8929a23b |
13 | 50140c58 |
14 | 2da3955d |
15 | 1c8c03b8 |
hex | 12bac5cf |
314230223 has 2 divisors, whose sum is σ = 314230224. Its totient is φ = 314230222.
The previous prime is 314230219. The next prime is 314230243. The reversal of 314230223 is 322032413.
It is an a-pointer prime, because the next prime (314230243) can be obtained adding 314230223 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 314230223 - 22 = 314230219 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 314230195 and 314230204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (314230243) 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 as a sum of consecutive naturals, namely, 157115111 + 157115112.
It is an arithmetic number, because the mean of its divisors is an integer number (157115112).
Almost surely, 2314230223 is an apocalyptic number.
314230223 is a deficient number, since it is larger than the sum of its proper divisors (1).
314230223 is an equidigital number, since it uses as much as digits as its factorization.
314230223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 20.
The square root of 314230223 is about 17726.5400741374. The cubic root of 314230223 is about 679.8545125600.
Adding to 314230223 its reverse (322032413), we get a palindrome (636262636).
The spelling of 314230223 in words is "three hundred fourteen million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •