Base | Representation |
---|---|
bin | 1010001100110000001001… |
… | …1010111111110000111011 |
3 | 1110201001210220012100200111 |
4 | 2203030002122333300323 |
5 | 2432213140230204321 |
6 | 35503422114045151 |
7 | 2235125223166432 |
oct | 243140232776073 |
9 | 43631726170614 |
10 | 11214200241211 |
11 | 3633a08756550 |
12 | 1311478b797b7 |
13 | 634657692106 |
14 | 2aaaad576119 |
15 | 146a916175e1 |
hex | a33026bfc3b |
11214200241211 has 16 divisors (see below), whose sum is σ = 12441254688000. Its totient is φ = 10021749170400.
The previous prime is 11214200241199. The next prime is 11214200241229.
11214200241211 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11214200241211 - 221 = 11214198144059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11214200841211) 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, 44207365 + ... + 44460313.
It is an arithmetic number, because the mean of its divisors is an integer number (777578418000).
Almost surely, 211214200241211 is an apocalyptic number.
11214200241211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11214200241211 is a deficient number, since it is larger than the sum of its proper divisors (1227054446789).
11214200241211 is a wasteful number, since it uses less digits than its factorization.
11214200241211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321330.
The product of its (nonzero) digits is 256, while the sum is 22.
It can be divided in two parts, 11214200 and 241211, that added together give a palindrome (11455411).
The spelling of 11214200241211 in words is "eleven trillion, two hundred fourteen billion, two hundred million, two hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •