Base | Representation |
---|---|
bin | 10100011011010110… |
… | …00100000111100111 |
3 | 1001022021222201122022 |
4 | 22031223010013213 |
5 | 134430000423421 |
6 | 5012120453355 |
7 | 535524233144 |
oct | 121553040747 |
9 | 31267881568 |
10 | 10966811111 |
11 | 471852a563 |
12 | 216091a25b |
13 | 105a0a7059 |
14 | 7607113cb |
15 | 442bd57ab |
hex | 28dac41e7 |
10966811111 has 4 divisors (see below), whose sum is σ = 10968850032. Its totient is φ = 10964772192.
The previous prime is 10966811057. The next prime is 10966811123. The reversal of 10966811111 is 11111866901.
10966811111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11111866901 = 9377 ⋅1185013.
It is a cyclic number.
It is not a de Polignac number, because 10966811111 - 210 = 10966810087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10966813111) 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 in 3 ways as a sum of consecutive naturals, for example, 1011371 + ... + 1022156.
It is an arithmetic number, because the mean of its divisors is an integer number (2742212508).
Almost surely, 210966811111 is an apocalyptic number.
10966811111 is a deficient number, since it is larger than the sum of its proper divisors (2038921).
10966811111 is an equidigital number, since it uses as much as digits as its factorization.
10966811111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2038920.
The product of its (nonzero) digits is 2592, while the sum is 35.
The spelling of 10966811111 in words is "ten billion, nine hundred sixty-six million, eight hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •