Base | Representation |
---|---|
bin | 111110100011111… |
… | …011101010011101 |
3 | 2201011000112212102 |
4 | 332203323222131 |
5 | 4122144404223 |
6 | 252052414445 |
7 | 35003340113 |
oct | 7643735235 |
9 | 2634015772 |
10 | 1049606813 |
11 | 499526152 |
12 | 253617425 |
13 | 1395b8628 |
14 | 9d581ab3 |
15 | 6222e928 |
hex | 3e8fba9d |
1049606813 has 4 divisors (see below), whose sum is σ = 1049674368. Its totient is φ = 1049539260.
The previous prime is 1049606777. The next prime is 1049606819. The reversal of 1049606813 is 3186069401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1049606813 - 228 = 781171357 is a prime.
It is a super-2 number, since 2×10496068132 = 2203348923792033938, 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 (1049606819) 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, 2558 + ... + 45888.
It is an arithmetic number, because the mean of its divisors is an integer number (262418592).
Almost surely, 21049606813 is an apocalyptic number.
It is an amenable number.
1049606813 is a deficient number, since it is larger than the sum of its proper divisors (67555).
1049606813 is an equidigital number, since it uses as much as digits as its factorization.
1049606813 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67554.
The product of its (nonzero) digits is 31104, while the sum is 38.
The square root of 1049606813 is about 32397.6359168381. The cubic root of 1049606813 is about 1016.2694730918.
The spelling of 1049606813 in words is "one billion, forty-nine million, six hundred six thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •