Base | Representation |
---|---|
bin | 10010101111101… |
… | …110100011010011 |
3 | 210220210022201110 |
4 | 102233232203103 |
5 | 1121003020311 |
6 | 51112504403 |
7 | 10536134334 |
oct | 2257564323 |
9 | 726708643 |
10 | 314501331 |
11 | 151589561 |
12 | 893ab103 |
13 | 50207481 |
14 | 2daaa28b |
15 | 1c9258a6 |
hex | 12bee8d3 |
314501331 has 8 divisors (see below), whose sum is σ = 419448784. Its totient is φ = 209610720.
The previous prime is 314501321. The next prime is 314501339. The reversal of 314501331 is 133105413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 314501331 - 26 = 314501267 is a prime.
It is a super-2 number, since 2×3145013312 = 197822174401543122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 314501298 and 314501307.
It is not an unprimeable number, because it can be changed into a prime (314501339) 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, 1041 + ... + 25101.
It is an arithmetic number, because the mean of its divisors is an integer number (52431098).
Almost surely, 2314501331 is an apocalyptic number.
314501331 is a deficient number, since it is larger than the sum of its proper divisors (104947453).
314501331 is a wasteful number, since it uses less digits than its factorization.
314501331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28421.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 314501331 is about 17734.1853774003. The cubic root of 314501331 is about 680.0499754216.
Adding to 314501331 its reverse (133105413), we get a palindrome (447606744).
The spelling of 314501331 in words is "three hundred fourteen million, five hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •