Base | Representation |
---|---|
bin | 10010101111000… |
… | …010010010001101 |
3 | 210220110002222222 |
4 | 102233002102031 |
5 | 1120431220023 |
6 | 51104545125 |
7 | 10534450610 |
oct | 2257022215 |
9 | 726402888 |
10 | 314320013 |
11 | 151475307 |
12 | 893221a5 |
13 | 50172a97 |
14 | 2da60177 |
15 | 1c8dbcc8 |
hex | 12bc248d |
314320013 has 8 divisors (see below), whose sum is σ = 360188928. Its totient is φ = 268692624.
The previous prime is 314320003. The next prime is 314320031. The reversal of 314320013 is 310023413.
It is a happy number.
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 314320013 - 24 = 314319997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 314319973 and 314320000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314320003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57581 + ... + 62802.
It is an arithmetic number, because the mean of its divisors is an integer number (45023616).
Almost surely, 2314320013 is an apocalyptic number.
It is an amenable number.
314320013 is a deficient number, since it is larger than the sum of its proper divisors (45868915).
314320013 is a wasteful number, since it uses less digits than its factorization.
314320013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120763.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 314320013 is about 17729.0725363737. The cubic root of 314320013 is about 679.9192616078.
Adding to 314320013 its reverse (310023413), we get a palindrome (624343426).
The spelling of 314320013 in words is "three hundred fourteen million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •