Base | Representation |
---|---|
bin | 101101101110100010001000… |
… | …110010101101111101011011 |
3 | 222101001220122210021210202101 |
4 | 231232202020302231331123 |
5 | 202324440424434232411 |
6 | 1551420330422544231 |
7 | 60234464255650201 |
oct | 5556421062557533 |
9 | 871056583253671 |
10 | 201109843664731 |
11 | 5909722990a351 |
12 | 1a680527898077 |
13 | 882a766547c31 |
14 | 3793aa8597071 |
15 | 183b4ddd1b8c1 |
hex | b6e888cadf5b |
201109843664731 has 2 divisors, whose sum is σ = 201109843664732. Its totient is φ = 201109843664730.
The previous prime is 201109843664701. The next prime is 201109843664791. The reversal of 201109843664731 is 137466348901102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201109843664731 - 211 = 201109843662683 is a prime.
It is a super-2 number, since 2×2011098436647312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201109843664701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100554921832365 + 100554921832366.
It is an arithmetic number, because the mean of its divisors is an integer number (100554921832366).
Almost surely, 2201109843664731 is an apocalyptic number.
201109843664731 is a deficient number, since it is larger than the sum of its proper divisors (1).
201109843664731 is an equidigital number, since it uses as much as digits as its factorization.
201109843664731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5225472, while the sum is 55.
The spelling of 201109843664731 in words is "two hundred one trillion, one hundred nine billion, eight hundred forty-three million, six hundred sixty-four thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •