Base | Representation |
---|---|
bin | 10010110110111… |
… | …111010010101111 |
3 | 211001101000221102 |
4 | 102312333102233 |
5 | 1121444424121 |
6 | 51221353315 |
7 | 10561253204 |
oct | 2266772257 |
9 | 731330842 |
10 | 316404911 |
11 | 152669769 |
12 | 89b6883b |
13 | 50722a54 |
14 | 30043cab |
15 | 1cb9e90b |
hex | 12dbf4af |
316404911 has 4 divisors (see below), whose sum is σ = 316615824. Its totient is φ = 316194000.
The previous prime is 316404899. The next prime is 316404923. The reversal of 316404911 is 119404613.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (316404899) and next prime (316404923).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-316404911 is a prime.
It is a super-2 number, since 2×3164049112 = 200224135409835842, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316404931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 103190 + ... + 106211.
It is an arithmetic number, because the mean of its divisors is an integer number (79153956).
Almost surely, 2316404911 is an apocalyptic number.
316404911 is a deficient number, since it is larger than the sum of its proper divisors (210913).
316404911 is a wasteful number, since it uses less digits than its factorization.
316404911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210912.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 316404911 is about 17787.7742002759. The cubic root of 316404911 is about 681.4192610763.
The spelling of 316404911 in words is "three hundred sixteen million, four hundred four thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •