Base | Representation |
---|---|
bin | 10010101111000… |
… | …010010010010101 |
3 | 210220110010000021 |
4 | 102233002102111 |
5 | 1120431220041 |
6 | 51104545141 |
7 | 10534450621 |
oct | 2257022225 |
9 | 726403007 |
10 | 314320021 |
11 | 151475314 |
12 | 893221b1 |
13 | 50172aa2 |
14 | 2da60181 |
15 | 1c8dbcd1 |
hex | 12bc2495 |
314320021 has 16 divisors (see below), whose sum is σ = 351812160. Its totient is φ = 279072000.
The previous prime is 314320003. The next prime is 314320031. The reversal of 314320021 is 120023413.
It is a happy number.
It is not a de Polignac number, because 314320021 - 25 = 314319989 is a prime.
It is a super-3 number, since 3×3143200213 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 314319977 and 314320004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314320031) 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 15 ways as a sum of consecutive naturals, for example, 79135 + ... + 83011.
It is an arithmetic number, because the mean of its divisors is an integer number (21988260).
Almost surely, 2314320021 is an apocalyptic number.
It is an amenable number.
314320021 is a deficient number, since it is larger than the sum of its proper divisors (37492139).
314320021 is a wasteful number, since it uses less digits than its factorization.
314320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4164.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 314320021 is about 17729.0727619918. The cubic root of 314320021 is about 679.9192673762.
Adding to 314320021 its reverse (120023413), we get a palindrome (434343434).
The spelling of 314320021 in words is "three hundred fourteen million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •