Base | Representation |
---|---|
bin | 1010001100110000001110… |
… | …0111101011011011100011 |
3 | 1110201001212022000122011121 |
4 | 2203030003213223123203 |
5 | 2432213210401434021 |
6 | 35503424112553111 |
7 | 2235125556101320 |
oct | 243140347533343 |
9 | 43631768018147 |
10 | 11214220343011 |
11 | 3633a19036304 |
12 | 1311483852797 |
13 | 63465b8ac97a |
14 | 2aaab20c9b47 |
15 | 146a93288741 |
hex | a33039eb6e3 |
11214220343011 has 16 divisors (see below), whose sum is σ = 12821634067968. Its totient is φ = 9608152996800.
The previous prime is 11214220342991. The next prime is 11214220343017. The reversal of 11214220343011 is 11034302241211.
It is a cyclic number.
It is not a de Polignac number, because 11214220343011 - 227 = 11214086125283 is a prime.
It is a super-2 number, since 2×112142203430112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11214220343017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 197714946 + ... + 197771656.
It is an arithmetic number, because the mean of its divisors is an integer number (801352129248).
Almost surely, 211214220343011 is an apocalyptic number.
11214220343011 is a deficient number, since it is larger than the sum of its proper divisors (1607413724957).
11214220343011 is an equidigital number, since it uses as much as digits as its factorization.
11214220343011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68082.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11214220343011 its reverse (11034302241211), we get a palindrome (22248522584222).
The spelling of 11214220343011 in words is "eleven trillion, two hundred fourteen billion, two hundred twenty million, three hundred forty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •