Base | Representation |
---|---|
bin | 11011100011111111000001… |
… | …101010110011110111011111 |
3 | 120220012112021222021222120222 |
4 | 123203333001222303313133 |
5 | 111342032241433021231 |
6 | 1105451430022431555 |
7 | 34350602234350214 |
oct | 3343770152636737 |
9 | 526175258258528 |
10 | 121220111220191 |
11 | 35696184644735 |
12 | 11719329b925bb |
13 | 5284013460b69 |
14 | 21d1128551b0b |
15 | e0332ec2b27b |
hex | 6e3fc1ab3ddf |
121220111220191 has 16 divisors (see below), whose sum is σ = 125533063180800. Its totient is φ = 116916032727648.
The previous prime is 121220111220157. The next prime is 121220111220193. The reversal of 121220111220191 is 191022111022121.
It is a cyclic number.
It is not a de Polignac number, because 121220111220191 - 210 = 121220111219167 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121220111220191.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121220111220193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 783266480 + ... + 783421226.
It is an arithmetic number, because the mean of its divisors is an integer number (7845816448800).
Almost surely, 2121220111220191 is an apocalyptic number.
121220111220191 is a deficient number, since it is larger than the sum of its proper divisors (4312951960609).
121220111220191 is a wasteful number, since it uses less digits than its factorization.
121220111220191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183238.
The product of its (nonzero) digits is 288, while the sum is 26.
The spelling of 121220111220191 in words is "one hundred twenty-one trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •