Base | Representation |
---|---|
bin | 10010101110001… |
… | …011101111100101 |
3 | 210220000202112220 |
4 | 102232023233211 |
5 | 1120402042423 |
6 | 51100102553 |
7 | 10532530365 |
oct | 2256135745 |
9 | 726022486 |
10 | 314096613 |
11 | 151332486 |
12 | 89234a59 |
13 | 500c51ac |
14 | 2da029a5 |
15 | 1c8959e3 |
hex | 12b8bbe5 |
314096613 has 8 divisors (see below), whose sum is σ = 429010176. Its totient is φ = 204290400.
The previous prime is 314096609. The next prime is 314096621. The reversal of 314096613 is 316690413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 314096613 - 22 = 314096609 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314096623) 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, 1276693 + ... + 1276938.
It is an arithmetic number, because the mean of its divisors is an integer number (53626272).
Almost surely, 2314096613 is an apocalyptic number.
It is an amenable number.
314096613 is a deficient number, since it is larger than the sum of its proper divisors (114913563).
314096613 is a wasteful number, since it uses less digits than its factorization.
314096613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2553675.
The product of its (nonzero) digits is 11664, while the sum is 33.
The square root of 314096613 is about 17722.7710305133. The cubic root of 314096613 is about 679.7581413517.
The spelling of 314096613 in words is "three hundred fourteen million, ninety-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •