Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …000111100000110110011 |
3 | 11022122021212210122001021 |
4 | 101300103220330012303 |
5 | 124442231123223443 |
6 | 2332301205520311 |
7 | 154102135451443 |
oct | 21602350740663 |
9 | 4278255718037 |
10 | 1220100211123 |
11 | 430494841222 |
12 | 178569113097 |
13 | 8b09397b261 |
14 | 430a5c58123 |
15 | 21b0e64d9ed |
hex | 11c13a3c1b3 |
1220100211123 has 2 divisors, whose sum is σ = 1220100211124. Its totient is φ = 1220100211122.
The previous prime is 1220100211081. The next prime is 1220100211133. The reversal of 1220100211123 is 3211120010221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1220100211123 - 237 = 1082661257651 is a prime.
It is a super-2 number, since 2×12201002111232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1220100211097 and 1220100211106.
It is not a weakly prime, because it can be changed into another prime (1220100211133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610050105561 + 610050105562.
It is an arithmetic number, because the mean of its divisors is an integer number (610050105562).
Almost surely, 21220100211123 is an apocalyptic number.
1220100211123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220100211123 is an equidigital number, since it uses as much as digits as its factorization.
1220100211123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1220100211123 its reverse (3211120010221), we get a palindrome (4431220221344).
The spelling of 1220100211123 in words is "one trillion, two hundred twenty billion, one hundred million, two hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •