Base | Representation |
---|---|
bin | 100000110100011… |
… | …0001111000001101 |
3 | 2211202010012220021 |
4 | 1001220301320031 |
5 | 4223402142401 |
6 | 301134422141 |
7 | 36201060106 |
oct | 10150617015 |
9 | 2752105807 |
10 | 1101209101 |
11 | 515670773 |
12 | 268961951 |
13 | 1471b5125 |
14 | a63753ad |
15 | 66a242a1 |
hex | 41a31e0d |
1101209101 has 2 divisors, whose sum is σ = 1101209102. Its totient is φ = 1101209100.
The previous prime is 1101209093. The next prime is 1101209113. The reversal of 1101209101 is 1019021011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1056185001 + 45024100 = 32499^2 + 6710^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101209101 - 23 = 1101209093 is a prime.
It is a super-2 number, since 2×11012091012 = 2425322968250456402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101209191) 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, 550604550 + 550604551.
It is an arithmetic number, because the mean of its divisors is an integer number (550604551).
Almost surely, 21101209101 is an apocalyptic number.
It is an amenable number.
1101209101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101209101 is an equidigital number, since it uses as much as digits as its factorization.
1101209101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 16.
The square root of 1101209101 is about 33184.4707807733. The cubic root of 1101209101 is about 1032.6581984536.
The spelling of 1101209101 in words is "one billion, one hundred one million, two hundred nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •