Base | Representation |
---|---|
bin | 100000110110010… |
… | …1000110000100001 |
3 | 2211211000121000212 |
4 | 1001230220300201 |
5 | 4224132022241 |
6 | 301212223505 |
7 | 36212501216 |
oct | 10154506041 |
9 | 2754017025 |
10 | 1102220321 |
11 | 5161a1494 |
12 | 26916ab95 |
13 | 14747a497 |
14 | a6559b0d |
15 | 66b73beb |
hex | 41b28c21 |
1102220321 has 2 divisors, whose sum is σ = 1102220322. Its totient is φ = 1102220320.
The previous prime is 1102220303. The next prime is 1102220341. The reversal of 1102220321 is 1230222011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 805140625 + 297079696 = 28375^2 + 17236^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102220321 - 26 = 1102220257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102220296 and 1102220305.
It is not a weakly prime, because it can be changed into another prime (1102220341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551110160 + 551110161.
It is an arithmetic number, because the mean of its divisors is an integer number (551110161).
Almost surely, 21102220321 is an apocalyptic number.
It is an amenable number.
1102220321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102220321 is an equidigital number, since it uses as much as digits as its factorization.
1102220321 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 14.
The square root of 1102220321 is about 33199.7036281952. The cubic root of 1102220321 is about 1032.9741920733.
Adding to 1102220321 its reverse (1230222011), we get a palindrome (2332442332).
The spelling of 1102220321 in words is "one billion, one hundred two million, two hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •