Base | Representation |
---|---|
bin | 10100100001110110… |
… | …00110000110111101 |
3 | 1001110002121100100212 |
4 | 22100323012012331 |
5 | 140032431021323 |
6 | 5021345402205 |
7 | 540055613534 |
oct | 122073060675 |
9 | 31402540325 |
10 | 11021345213 |
11 | 474629786a |
12 | 2177039365 |
13 | 106848c158 |
14 | 767a6931b |
15 | 4478a8b78 |
hex | 290ec61bd |
11021345213 has 8 divisors (see below), whose sum is σ = 11048632320. Its totient is φ = 10994078160.
The previous prime is 11021345201. The next prime is 11021345261. The reversal of 11021345213 is 31254312011.
11021345213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11021345213 - 24 = 11021345197 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 (11021315213) 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 7 ways as a sum of consecutive naturals, for example, 2150468 + ... + 2155586.
It is an arithmetic number, because the mean of its divisors is an integer number (1381079040).
Almost surely, 211021345213 is an apocalyptic number.
It is an amenable number.
11021345213 is a deficient number, since it is larger than the sum of its proper divisors (27287107).
11021345213 is an equidigital number, since it uses as much as digits as its factorization.
11021345213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10027.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 11021345213 its reverse (31254312011), we get a palindrome (42275657224).
The spelling of 11021345213 in words is "eleven billion, twenty-one million, three hundred forty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •