Base | Representation |
---|---|
bin | 10010100010110… |
… | …001101101101101 |
3 | 210200101211202202 |
4 | 102202301231231 |
5 | 1114120401123 |
6 | 50512031245 |
7 | 10465234532 |
oct | 2242615555 |
9 | 720354682 |
10 | 311106413 |
11 | 14a67a942 |
12 | 88232525 |
13 | 4c5b9147 |
14 | 2d464d89 |
15 | 1c4a4a28 |
hex | 128b1b6d |
311106413 has 4 divisors (see below), whose sum is σ = 311155068. Its totient is φ = 311057760.
The previous prime is 311106407. The next prime is 311106473. The reversal of 311106413 is 314601113.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 250842244 + 60264169 = 15838^2 + 7763^2 .
It is a cyclic number.
It is not a de Polignac number, because 311106413 - 212 = 311102317 is a prime.
It is a super-3 number, since 3×3111064133 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311106473) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12968 + ... + 28113.
It is an arithmetic number, because the mean of its divisors is an integer number (77788767).
Almost surely, 2311106413 is an apocalyptic number.
It is an amenable number.
311106413 is a deficient number, since it is larger than the sum of its proper divisors (48655).
311106413 is an equidigital number, since it uses as much as digits as its factorization.
311106413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48654.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 311106413 is about 17638.2088943294. The cubic root of 311106413 is about 677.5941603763.
Adding to 311106413 its reverse (314601113), we get a palindrome (625707526).
The spelling of 311106413 in words is "three hundred eleven million, one hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •