Base | Representation |
---|---|
bin | 100100010111100… |
… | …1001111101001101 |
3 | 10011001020201211211 |
4 | 1020233021331031 |
5 | 4444400233401 |
6 | 321031414421 |
7 | 42145362316 |
oct | 11057117515 |
9 | 3131221754 |
10 | 1220321101 |
11 | 57692633a |
12 | 2a0824411 |
13 | 165a8aabc |
14 | b80dd60d |
15 | 72201951 |
hex | 48bc9f4d |
1220321101 has 2 divisors, whose sum is σ = 1220321102. Its totient is φ = 1220321100.
The previous prime is 1220321083. The next prime is 1220321177. The reversal of 1220321101 is 1011230221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1190181001 + 30140100 = 34499^2 + 5490^2 .
It is an emirp because it is prime and its reverse (1011230221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1220321101 - 27 = 1220320973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220325101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610160550 + 610160551.
It is an arithmetic number, because the mean of its divisors is an integer number (610160551).
Almost surely, 21220321101 is an apocalyptic number.
It is an amenable number.
1220321101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220321101 is an equidigital number, since it uses as much as digits as its factorization.
1220321101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1220321101 is about 34933.0946381794. The cubic root of 1220321101 is about 1068.6234667248.
Adding to 1220321101 its reverse (1011230221), we get a palindrome (2231551322).
The spelling of 1220321101 in words is "one billion, two hundred twenty million, three hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •