Base | Representation |
---|---|
bin | 1010001100101000101111… |
… | …0010110111101111110001 |
3 | 1110200212200012020012020221 |
4 | 2203022023302313233301 |
5 | 2432200101230323441 |
6 | 35502452420333041 |
7 | 2235025005415360 |
oct | 243121362675761 |
9 | 43625605205227 |
10 | 11212210011121 |
11 | 3633087282199 |
12 | 1311002544181 |
13 | 6343cb258982 |
14 | 2aa9611017d7 |
15 | 1469c6a348d1 |
hex | a328bcb7bf1 |
11212210011121 has 8 divisors (see below), whose sum is σ = 12814351236864. Its totient is φ = 9610168020000.
The previous prime is 11212210011109. The next prime is 11212210011169. The reversal of 11212210011121 is 12111001221211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11212210011121 - 215 = 11212209978353 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11212210011095 and 11212210011104.
It is not an unprimeable number, because it can be changed into a prime (11212210011421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24566380 + ... + 25018621.
It is an arithmetic number, because the mean of its divisors is an integer number (1601793904608).
Almost surely, 211212210011121 is an apocalyptic number.
It is an amenable number.
11212210011121 is a deficient number, since it is larger than the sum of its proper divisors (1602141225743).
11212210011121 is an equidigital number, since it uses as much as digits as its factorization.
11212210011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49617311.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11212210011121 its reverse (12111001221211), we get a palindrome (23323211232332).
The spelling of 11212210011121 in words is "eleven trillion, two hundred twelve billion, two hundred ten million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •