Base | Representation |
---|---|
bin | 110010111100111000… |
… | …1011011111100101111 |
3 | 101110102110201220120222 |
4 | 1211321301123330233 |
5 | 3243041244410241 |
6 | 122133210001555 |
7 | 10622313504365 |
oct | 1457161337457 |
9 | 343373656528 |
10 | 109417185071 |
11 | 4244916a687 |
12 | 192577162bb |
13 | a41983a3bc |
14 | 541da31635 |
15 | 2ca5d71a4b |
hex | 1979c5bf2f |
109417185071 has 4 divisors (see below), whose sum is σ = 112085896944. Its totient is φ = 106748473200.
The previous prime is 109417185067. The next prime is 109417185079. The reversal of 109417185071 is 170581714901.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 170581714901 = 13 ⋅13121670377.
It is a cyclic number.
It is not a de Polignac number, because 109417185071 - 22 = 109417185067 is a prime.
It is a super-2 number, since 2×1094171850712 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109417185079) 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, 1334355875 + ... + 1334355956.
It is an arithmetic number, because the mean of its divisors is an integer number (28021474236).
Almost surely, 2109417185071 is an apocalyptic number.
109417185071 is a deficient number, since it is larger than the sum of its proper divisors (2668711873).
109417185071 is an equidigital number, since it uses as much as digits as its factorization.
109417185071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2668711872.
The product of its (nonzero) digits is 70560, while the sum is 44.
Adding to 109417185071 its reverse (170581714901), we get a palindrome (279998899972).
The spelling of 109417185071 in words is "one hundred nine billion, four hundred seventeen million, one hundred eighty-five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •