Base | Representation |
---|---|
bin | 10100100000101111… |
… | …00001111111000011 |
3 | 1001102110001200121111 |
4 | 22100113201333003 |
5 | 140023034202321 |
6 | 5020413504151 |
7 | 536613434011 |
oct | 122027417703 |
9 | 31373050544 |
10 | 11012022211 |
11 | 4740aaa303 |
12 | 2173aa2057 |
13 | 1066576798 |
14 | 76671d8b1 |
15 | 446b665e1 |
hex | 2905e1fc3 |
11012022211 has 4 divisors (see below), whose sum is σ = 11118935152. Its totient is φ = 10905109272.
The previous prime is 11012022193. The next prime is 11012022227. The reversal of 11012022211 is 11222021011.
11012022211 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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11012022211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012022191 and 11012022200.
It is not an unprimeable number, because it can be changed into a prime (11012022311) 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, 53456316 + ... + 53456521.
It is an arithmetic number, because the mean of its divisors is an integer number (2779733788).
Almost surely, 211012022211 is an apocalyptic number.
11012022211 is a deficient number, since it is larger than the sum of its proper divisors (106912941).
11012022211 is a wasteful number, since it uses less digits than its factorization.
11012022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106912940.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11012022211 its reverse (11222021011), we get a palindrome (22234043222).
The spelling of 11012022211 in words is "eleven billion, twelve million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •