Base | Representation |
---|---|
bin | 1011100110010010… |
… | …1011100010111111 |
3 | 22000222102010121001 |
4 | 2321210223202333 |
5 | 22334012304021 |
6 | 1232534551131 |
7 | 140103316264 |
oct | 27144534277 |
9 | 8028363531 |
10 | 3113400511 |
11 | 1358484981 |
12 | 72a8084a7 |
13 | 3a803a630 |
14 | 2176c526b |
15 | 1334e4091 |
hex | b992b8bf |
3113400511 has 8 divisors (see below), whose sum is σ = 3355496144. Its totient is φ = 2871676800.
The previous prime is 3113400469. The next prime is 3113400517. The reversal of 3113400511 is 1150043113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3113400511 is a prime.
It is a super-2 number, since 2×31134005112 = 19386525483790122242, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3113400517) 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 7 ways as a sum of consecutive naturals, for example, 75465 + ... + 109186.
It is an arithmetic number, because the mean of its divisors is an integer number (419437018).
Almost surely, 23113400511 is an apocalyptic number.
3113400511 is a deficient number, since it is larger than the sum of its proper divisors (242095633).
3113400511 is a wasteful number, since it uses less digits than its factorization.
3113400511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185961.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 3113400511 is about 55797.8539999524. The cubic root of 3113400511 is about 1460.1977137322.
Adding to 3113400511 its reverse (1150043113), we get a palindrome (4263443624).
The spelling of 3113400511 in words is "three billion, one hundred thirteen million, four hundred thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •