Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …110110100110010010101 |
3 | 10220021102100212100000201 |
4 | 100001211112310302111 |
5 | 121020240300004343 |
6 | 2201520113140501 |
7 | 142363030330603 |
oct | 20014526646225 |
9 | 3807370770021 |
10 | 1101212109973 |
11 | 395026589178 |
12 | 15950985a731 |
13 | 7cac7c4c801 |
14 | 3b42846a873 |
15 | 1d9a20ce94d |
hex | 100655b4c95 |
1101212109973 has 2 divisors, whose sum is σ = 1101212109974. Its totient is φ = 1101212109972.
The previous prime is 1101212109931. The next prime is 1101212110087. The reversal of 1101212109973 is 3799012121011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 763416345169 + 337795764804 = 873737^2 + 581202^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101212109973 - 29 = 1101212109461 is a prime.
It is a super-3 number, since 3×11012121099733 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101212109913) 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, 550606054986 + 550606054987.
It is an arithmetic number, because the mean of its divisors is an integer number (550606054987).
Almost surely, 21101212109973 is an apocalyptic number.
It is an amenable number.
1101212109973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101212109973 is an equidigital number, since it uses as much as digits as its factorization.
1101212109973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 37.
The spelling of 1101212109973 in words is "one trillion, one hundred one billion, two hundred twelve million, one hundred nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •