Base | Representation |
---|---|
bin | 1010010010111110110011… |
… | …0001000010001100111011 |
3 | 1111002022000200000022221022 |
4 | 2210233230301002030323 |
5 | 2440441320020231021 |
6 | 40024520444133055 |
7 | 2245634110410356 |
oct | 244575461021473 |
9 | 44068020008838 |
10 | 11321211102011 |
11 | 3675331584088 |
12 | 132a16283718b |
13 | 64177c80b0a5 |
14 | 2b1d4177d29d |
15 | 1497560b41ab |
hex | a4becc4233b |
11321211102011 has 4 divisors (see below), whose sum is σ = 11321252720232. Its totient is φ = 11321169483792.
The previous prime is 11321211102001. The next prime is 11321211102037. The reversal of 11321211102011 is 11020111212311.
11321211102011 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-11321211102011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11321211102001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20398370 + ... + 20946023.
It is an arithmetic number, because the mean of its divisors is an integer number (2830313180058).
Almost surely, 211321211102011 is an apocalyptic number.
11321211102011 is a deficient number, since it is larger than the sum of its proper divisors (41618221).
11321211102011 is an equidigital number, since it uses as much as digits as its factorization.
11321211102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41618220.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 11321211102011 its reverse (11020111212311), we get a palindrome (22341322314322).
The spelling of 11321211102011 in words is "eleven trillion, three hundred twenty-one billion, two hundred eleven million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •