Base | Representation |
---|---|
bin | 1010001100101000011110… |
… | …1000111100011110110011 |
3 | 1110200212111100001111212101 |
4 | 2203022013220330132303 |
5 | 2432144430404101321 |
6 | 35502441450241231 |
7 | 2235023201034514 |
oct | 243120750743663 |
9 | 43625440044771 |
10 | 11212140300211 |
11 | 3633050999374 |
12 | 1310ba3126217 |
13 | 6343b998b906 |
14 | 2aa955b56a0b |
15 | 1469c0864791 |
hex | a3287a3c7b3 |
11212140300211 has 16 divisors (see below), whose sum is σ = 11404919623680. Its totient is φ = 11021008430880.
The previous prime is 11212140300203. The next prime is 11212140300269. The reversal of 11212140300211 is 11200304121211.
It is a cyclic number.
It is not a de Polignac number, because 11212140300211 - 23 = 11212140300203 is a prime.
It is a super-2 number, since 2×112121403002112 (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 (11212140303211) 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, 315754920 + ... + 315790426.
It is an arithmetic number, because the mean of its divisors is an integer number (712807476480).
Almost surely, 211212140300211 is an apocalyptic number.
11212140300211 is a deficient number, since it is larger than the sum of its proper divisors (192779323469).
11212140300211 is a wasteful number, since it uses less digits than its factorization.
11212140300211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58554.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 11212140300211 its reverse (11200304121211), we get a palindrome (22412444421422).
The spelling of 11212140300211 in words is "eleven trillion, two hundred twelve billion, one hundred forty million, three hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •