Base | Representation |
---|---|
bin | 1010001100110000001100… |
… | …0100111101010011111011 |
3 | 1110201001211122220012211220 |
4 | 2203030003010331103323 |
5 | 2432213201034204321 |
6 | 35503423145523123 |
7 | 2235125415532416 |
oct | 243140304752373 |
9 | 43631748805756 |
10 | 11214211241211 |
11 | 3633a13989a60 |
12 | 13114807a34a3 |
13 | 634659a43ba4 |
14 | 2aaab0bdab7d |
15 | 146a9258b9c6 |
hex | a330313d4fb |
11214211241211 has 32 divisors (see below), whose sum is σ = 16753186595328. Its totient is φ = 6612505424640.
The previous prime is 11214211241203. The next prime is 11214211241231.
11214211241211 is nontrivially palindromic in base 10.
11214211241211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11214211241211 - 23 = 11214211241203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11214211241231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28612410 + ... + 29001696.
It is an arithmetic number, because the mean of its divisors is an integer number (523537081104).
Almost surely, 211214211241211 is an apocalyptic number.
11214211241211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11214211241211 is a deficient number, since it is larger than the sum of its proper divisors (5538975354117).
11214211241211 is a wasteful number, since it uses less digits than its factorization.
11214211241211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 412931.
The product of its digits is 256, while the sum is 24.
It can be divided in two parts, 1121421 and 1241211, that added together give a palindrome (2362632).
The spelling of 11214211241211 in words is "eleven trillion, two hundred fourteen billion, two hundred eleven million, two hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •