Base | Representation |
---|---|
bin | 11001010010010101010110… |
… | …101111001011000111011001 |
3 | 112120202200010211100211221212 |
4 | 121102111112233023013121 |
5 | 104034040204102332301 |
6 | 1032305351550512505 |
7 | 32265506220553511 |
oct | 3122252657130731 |
9 | 476680124324855 |
10 | 111211043402201 |
11 | 3248737a809866 |
12 | 10581541505735 |
13 | 4a0920579ba82 |
14 | 1d66900dd6841 |
15 | ccccc3bb24bb |
hex | 652556bcb1d9 |
111211043402201 has 4 divisors (see below), whose sum is σ = 111218646550992. Its totient is φ = 111203440253412.
The previous prime is 111211043402171. The next prime is 111211043402203. The reversal of 111211043402201 is 102204340112111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111211043402201 - 222 = 111211039207897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111211043402203) 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, 3801552455 + ... + 3801581708.
It is an arithmetic number, because the mean of its divisors is an integer number (27804661637748).
Almost surely, 2111211043402201 is an apocalyptic number.
It is an amenable number.
111211043402201 is a deficient number, since it is larger than the sum of its proper divisors (7603148791).
111211043402201 is an equidigital number, since it uses as much as digits as its factorization.
111211043402201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7603148790.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 111211043402201 its reverse (102204340112111), we get a palindrome (213415383514312).
The spelling of 111211043402201 in words is "one hundred eleven trillion, two hundred eleven billion, forty-three million, four hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •