Base | Representation |
---|---|
bin | 10000010011011000010… |
… | …010011001111000011101 |
3 | 10222002202001002220002221 |
4 | 100103120102121320131 |
5 | 121323403432401341 |
6 | 2214400141545341 |
7 | 143640402402535 |
oct | 20233022317035 |
9 | 3862661086087 |
10 | 1120320200221 |
11 | 3a21416011a2 |
12 | 161160b75251 |
13 | 818519042a1 |
14 | 3c31c1004c5 |
15 | 1e21e8baed1 |
hex | 104d8499e1d |
1120320200221 has 2 divisors, whose sum is σ = 1120320200222. Its totient is φ = 1120320200220.
The previous prime is 1120320200101. The next prime is 1120320200227. The reversal of 1120320200221 is 1220020230211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1082142948121 + 38177252100 = 1040261^2 + 195390^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120320200221 - 223 = 1120311811613 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120320200195 and 1120320200204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120320200227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560160100110 + 560160100111.
It is an arithmetic number, because the mean of its divisors is an integer number (560160100111).
Almost surely, 21120320200221 is an apocalyptic number.
It is an amenable number.
1120320200221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120320200221 is an equidigital number, since it uses as much as digits as its factorization.
1120320200221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 1120320200221 its reverse (1220020230211), we get a palindrome (2340340430432).
The spelling of 1120320200221 in words is "one trillion, one hundred twenty billion, three hundred twenty million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •