Base | Representation |
---|---|
bin | 10100010100110010… |
… | …10010110001101111 |
3 | 1001011110111221021020 |
4 | 22022121102301233 |
5 | 134321411232121 |
6 | 5002434105223 |
7 | 534255642645 |
oct | 121231226157 |
9 | 31143457236 |
10 | 10911820911 |
11 | 469a490612 |
12 | 214641b213 |
13 | 104b892484 |
14 | 7572b9195 |
15 | 43ce721c6 |
hex | 28a652c6f |
10911820911 has 16 divisors (see below), whose sum is σ = 14892594816. Its totient is φ = 7102914336.
The previous prime is 10911820891. The next prime is 10911820919. The reversal of 10911820911 is 11902811901.
10911820911 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10911820911 - 29 = 10911820399 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10911820919) 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, 406636 + ... + 432638.
It is an arithmetic number, because the mean of its divisors is an integer number (930787176).
Almost surely, 210911820911 is an apocalyptic number.
10911820911 is a deficient number, since it is larger than the sum of its proper divisors (3980773905).
10911820911 is a wasteful number, since it uses less digits than its factorization.
10911820911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29302.
The product of its (nonzero) digits is 1296, while the sum is 33.
Multiplying 10911820911 by its sum of digits (33), we get a palindrome (360090090063).
The spelling of 10911820911 in words is "ten billion, nine hundred eleven million, eight hundred twenty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •