Base | Representation |
---|---|
bin | 1010001100100111111101… |
… | …1001011010001111111111 |
3 | 1110200212010200211122111211 |
4 | 2203021333121122033333 |
5 | 2432144140003310421 |
6 | 35502420030225251 |
7 | 2235016601425420 |
oct | 243117731321777 |
9 | 43625120748454 |
10 | 11212002010111 |
11 | 3632a8a924a31 |
12 | 1310b64955227 |
13 | 63439712c956 |
14 | 2aa941639647 |
15 | 1469b36499e1 |
hex | a327f65a3ff |
11212002010111 has 4 divisors (see below), whose sum is σ = 12813716582992. Its totient is φ = 9610287437232.
The previous prime is 11212002010087. The next prime is 11212002010117. The reversal of 11212002010111 is 11101020021211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11212002010111 - 219 = 11212001485823 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11212002010091 and 11212002010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212002010117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 800857286430 + ... + 800857286443.
It is an arithmetic number, because the mean of its divisors is an integer number (3203429145748).
Almost surely, 211212002010111 is an apocalyptic number.
11212002010111 is a deficient number, since it is larger than the sum of its proper divisors (1601714572881).
11212002010111 is an equidigital number, since it uses as much as digits as its factorization.
11212002010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1601714572880.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11212002010111 its reverse (11101020021211), we get a palindrome (22313022031322).
The spelling of 11212002010111 in words is "eleven trillion, two hundred twelve billion, two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •