Base | Representation |
---|---|
bin | 10100100000101110… |
… | …11011010011010101 |
3 | 1001102110000022001122 |
4 | 22100113123103111 |
5 | 140023032313322 |
6 | 5020413133325 |
7 | 536613261134 |
oct | 122027332325 |
9 | 31373008048 |
10 | 11011994837 |
11 | 4740a90788 |
12 | 2173a8a245 |
13 | 106656719c |
14 | 76671391b |
15 | 446b5d442 |
hex | 2905db4d5 |
11011994837 has 2 divisors, whose sum is σ = 11011994838. Its totient is φ = 11011994836.
The previous prime is 11011994821. The next prime is 11011994899. The reversal of 11011994837 is 73849911011.
11011994837 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9110511601 + 1901483236 = 95449^2 + 43606^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011994837 - 24 = 11011994821 is a prime.
It is a super-2 number, since 2×110119948372 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011990837) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505997418 + 5505997419.
It is an arithmetic number, because the mean of its divisors is an integer number (5505997419).
Almost surely, 211011994837 is an apocalyptic number.
It is an amenable number.
11011994837 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011994837 is an equidigital number, since it uses as much as digits as its factorization.
11011994837 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 44.
The spelling of 11011994837 in words is "eleven billion, eleven million, nine hundred ninety-four thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •