Base | Representation |
---|---|
bin | 10000000110110000101… |
… | …101001000000100100111 |
3 | 10220210202210022002222211 |
4 | 100012300231020010213 |
5 | 121113131412332011 |
6 | 2204235500104251 |
7 | 142650552050035 |
oct | 20066055100447 |
9 | 3823683262884 |
10 | 1106771214631 |
11 | 397419551845 |
12 | 15a5bb535087 |
13 | 804a2888a54 |
14 | 3b7d48ab555 |
15 | 1dbca176b21 |
hex | 101b0b48127 |
1106771214631 has 2 divisors, whose sum is σ = 1106771214632. Its totient is φ = 1106771214630.
The previous prime is 1106771214613. The next prime is 1106771214667. The reversal of 1106771214631 is 1364121776011.
Together with previous prime (1106771214613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1106771214631 - 211 = 1106771212583 is a prime.
It is a super-2 number, since 2×11067712146312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1106771214931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 553385607315 + 553385607316.
It is an arithmetic number, because the mean of its divisors is an integer number (553385607316).
Almost surely, 21106771214631 is an apocalyptic number.
1106771214631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1106771214631 is an equidigital number, since it uses as much as digits as its factorization.
1106771214631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 40.
The spelling of 1106771214631 in words is "one trillion, one hundred six billion, seven hundred seventy-one million, two hundred fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •