Base | Representation |
---|---|
bin | 110001101100011010… |
… | …1000101110010010011 |
3 | 101012110021212212020021 |
4 | 1203120311011302103 |
5 | 3222024023323331 |
6 | 121005231524311 |
7 | 10465355425135 |
oct | 1433065056223 |
9 | 335407785207 |
10 | 106717011091 |
11 | 41292a74a39 |
12 | 18823389697 |
13 | a0a92c2712 |
14 | 5245195055 |
15 | 2b98ca5211 |
hex | 18d8d45c93 |
106717011091 has 4 divisors (see below), whose sum is σ = 109601254672. Its totient is φ = 103832767512.
The previous prime is 106717011073. The next prime is 106717011109. The reversal of 106717011091 is 190110717601.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (106717011073) and next prime (106717011109).
It is a cyclic number.
It is not a de Polignac number, because 106717011091 - 29 = 106717010579 is a prime.
It is a super-2 number, since 2×1067170110912 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106717011061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1442121735 + ... + 1442121808.
It is an arithmetic number, because the mean of its divisors is an integer number (27400313668).
Almost surely, 2106717011091 is an apocalyptic number.
106717011091 is a deficient number, since it is larger than the sum of its proper divisors (2884243581).
106717011091 is an equidigital number, since it uses as much as digits as its factorization.
106717011091 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2884243580.
The product of its (nonzero) digits is 2646, while the sum is 34.
Adding to 106717011091 its reverse (190110717601), we get a palindrome (296827728692).
The spelling of 106717011091 in words is "one hundred six billion, seven hundred seventeen million, eleven thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •