Base | Representation |
---|---|
bin | 100000110100011… |
… | …0100100110100101 |
3 | 2211202010210012121 |
4 | 1001220310212211 |
5 | 4223403022021 |
6 | 301134545541 |
7 | 36201134461 |
oct | 10150644645 |
9 | 2752123177 |
10 | 1101220261 |
11 | 515679099 |
12 | 2689682b1 |
13 | 1471ba22b |
14 | a63794a1 |
15 | 66a27741 |
hex | 41a349a5 |
1101220261 has 2 divisors, whose sum is σ = 1101220262. Its totient is φ = 1101220260.
The previous prime is 1101220247. The next prime is 1101220301. The reversal of 1101220261 is 1620221011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1055860036 + 45360225 = 32494^2 + 6735^2 .
It is an emirp because it is prime and its reverse (1620221011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101220261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101220661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550610130 + 550610131.
It is an arithmetic number, because the mean of its divisors is an integer number (550610131).
Almost surely, 21101220261 is an apocalyptic number.
It is an amenable number.
1101220261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101220261 is an equidigital number, since it uses as much as digits as its factorization.
1101220261 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.
The square root of 1101220261 is about 33184.6389312887. The cubic root of 1101220261 is about 1032.6616868697.
Adding to 1101220261 its reverse (1620221011), we get a palindrome (2721441272).
The spelling of 1101220261 in words is "one billion, one hundred one million, two hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •