Base | Representation |
---|---|
bin | 1011010101110001… |
… | …0111001100001001 |
3 | 21212011000212102001 |
4 | 2311130113030021 |
5 | 22213243023423 |
6 | 1222021511001 |
7 | 135302342341 |
oct | 26534271411 |
9 | 7764025361 |
10 | 3044111113 |
11 | 132235980a |
12 | 70b572461 |
13 | 39688a3a4 |
14 | 20c409d21 |
15 | 12c3a8cad |
hex | b5717309 |
3044111113 has 2 divisors, whose sum is σ = 3044111114. Its totient is φ = 3044111112.
The previous prime is 3044111107. The next prime is 3044111117. The reversal of 3044111113 is 3111114403.
3044111113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3029731849 + 14379264 = 55043^2 + 3792^2 .
It is a cyclic number.
It is not a de Polignac number, because 3044111113 - 229 = 2507240201 is a prime.
It is a super-2 number, since 2×30441111132 = 18533224936580197538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3044111117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1522055556 + 1522055557.
It is an arithmetic number, because the mean of its divisors is an integer number (1522055557).
Almost surely, 23044111113 is an apocalyptic number.
It is an amenable number.
3044111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3044111113 is an equidigital number, since it uses as much as digits as its factorization.
3044111113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 3044111113 is about 55173.4638481218. The cubic root of 3044111113 is about 1449.2840084607.
Adding to 3044111113 its reverse (3111114403), we get a palindrome (6155225516).
The spelling of 3044111113 in words is "three billion, forty-four million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •