Base | Representation |
---|---|
bin | 110001100110010101… |
… | …1101101110101010011 |
3 | 101011221002102120010201 |
4 | 1203030223231311103 |
5 | 3221114341231331 |
6 | 120533112040031 |
7 | 10460332330525 |
oct | 1431453556523 |
9 | 334832376121 |
10 | 106513227091 |
11 | 41198a38007 |
12 | 18787093017 |
13 | a076011c7b |
14 | 52260a9a15 |
15 | 2b85e4ea61 |
hex | 18ccaedd53 |
106513227091 has 2 divisors, whose sum is σ = 106513227092. Its totient is φ = 106513227090.
The previous prime is 106513227059. The next prime is 106513227131. The reversal of 106513227091 is 190722315601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 106513227091 - 25 = 106513227059 is a prime.
It is a super-2 number, since 2×1065132270912 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106513227091.
It is not a weakly prime, because it can be changed into another prime (106513207091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53256613545 + 53256613546.
It is an arithmetic number, because the mean of its divisors is an integer number (53256613546).
Almost surely, 2106513227091 is an apocalyptic number.
106513227091 is a deficient number, since it is larger than the sum of its proper divisors (1).
106513227091 is an equidigital number, since it uses as much as digits as its factorization.
106513227091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 37.
The spelling of 106513227091 in words is "one hundred six billion, five hundred thirteen million, two hundred twenty-seven thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •