Base | Representation |
---|---|
bin | 10000010011010001110… |
… | …110011111100100111111 |
3 | 10222002110111220221101202 |
4 | 100103101312133210333 |
5 | 121323143312021343 |
6 | 2214341323330115 |
7 | 143634621523205 |
oct | 20232166374477 |
9 | 3862414827352 |
10 | 1120212220223 |
11 | 3a209665a228 |
12 | 16113098093b |
13 | 818354284b5 |
14 | 3c30ba33075 |
15 | 1e21518bdb8 |
hex | 104d1d9f93f |
1120212220223 has 2 divisors, whose sum is σ = 1120212220224. Its totient is φ = 1120212220222.
The previous prime is 1120212220163. The next prime is 1120212220241. The reversal of 1120212220223 is 3220222120211.
It is a strong prime.
It is an emirp because it is prime and its reverse (3220222120211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1120212220223 - 222 = 1120208025919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120212220195 and 1120212220204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120212210223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560106110111 + 560106110112.
It is an arithmetic number, because the mean of its divisors is an integer number (560106110112).
Almost surely, 21120212220223 is an apocalyptic number.
1120212220223 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120212220223 is an equidigital number, since it uses as much as digits as its factorization.
1120212220223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 1120212220223 its reverse (3220222120211), we get a palindrome (4340434340434).
The spelling of 1120212220223 in words is "one trillion, one hundred twenty billion, two hundred twelve million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •