Base | Representation |
---|---|
bin | 100000110100001… |
… | …1000110000100101 |
3 | 2211201220222202121 |
4 | 1001220120300211 |
5 | 4223340344323 |
6 | 301132305541 |
7 | 36200151124 |
oct | 10150306045 |
9 | 2751828677 |
10 | 1101106213 |
11 | 515600439 |
12 | 2689122b1 |
13 | 14717a34c |
14 | a6349abb |
15 | 66a03a5d |
hex | 41a18c25 |
1101106213 has 2 divisors, whose sum is σ = 1101106214. Its totient is φ = 1101106212.
The previous prime is 1101106169. The next prime is 1101106219. The reversal of 1101106213 is 3126011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1086229764 + 14876449 = 32958^2 + 3857^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101106213 - 221 = 1099009061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101106219) 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, 550553106 + 550553107.
It is an arithmetic number, because the mean of its divisors is an integer number (550553107).
Almost surely, 21101106213 is an apocalyptic number.
It is an amenable number.
1101106213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101106213 is an equidigital number, since it uses as much as digits as its factorization.
1101106213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 1101106213 is about 33182.9205013664. The cubic root of 1101106213 is about 1032.6260363978.
Adding to 1101106213 its reverse (3126011011), we get a palindrome (4227117224).
The spelling of 1101106213 in words is "one billion, one hundred one million, one hundred six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •