Base | Representation |
---|---|
bin | 10100100111010000… |
… | …00111001110100111 |
3 | 1001120020221122102010 |
4 | 22103220013032213 |
5 | 140131033410321 |
6 | 5030045445303 |
7 | 541146255363 |
oct | 122350071647 |
9 | 31506848363 |
10 | 11066700711 |
11 | 4769956050 |
12 | 218a270833 |
13 | 10749ac521 |
14 | 76dab42a3 |
15 | 44b867676 |
hex | 293a073a7 |
11066700711 has 16 divisors (see below), whose sum is σ = 16098997248. Its totient is φ = 6706267200.
The previous prime is 11066700709. The next prime is 11066700713. The reversal of 11066700711 is 11700766011.
11066700711 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11066700709) and next prime (11066700713).
It is not a de Polignac number, because 11066700711 - 21 = 11066700709 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11066700713) 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 15 ways as a sum of consecutive naturals, for example, 353290 + ... + 383336.
It is an arithmetic number, because the mean of its divisors is an integer number (1006187328).
Almost surely, 211066700711 is an apocalyptic number.
11066700711 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11066700711 is a deficient number, since it is larger than the sum of its proper divisors (5032296537).
11066700711 is a wasteful number, since it uses less digits than its factorization.
11066700711 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41222.
The product of its (nonzero) digits is 1764, while the sum is 30.
The spelling of 11066700711 in words is "eleven billion, sixty-six million, seven hundred thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •