Base | Representation |
---|---|
bin | 110011000111011101… |
… | …1100110011100101101 |
3 | 101111100012201001210221 |
4 | 1212032323212130231 |
5 | 3244303133433203 |
6 | 122232330331341 |
7 | 10634154026056 |
oct | 1461673463455 |
9 | 344305631727 |
10 | 109772171053 |
11 | 4261058a926 |
12 | 19336589b51 |
13 | a47524ab8c |
14 | 5454c3972d |
15 | 2cc70e2abd |
hex | 198eee672d |
109772171053 has 4 divisors (see below), whose sum is σ = 115549653760. Its totient is φ = 103994688348.
The previous prime is 109772170987. The next prime is 109772171063. The reversal of 109772171053 is 350171277901.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 350171277901 = 56101 ⋅6241801.
It is a cyclic number.
It is not a de Polignac number, because 109772171053 - 213 = 109772162861 is a prime.
It is a super-2 number, since 2×1097721710532 (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 (109772171063) 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, 2888741325 + ... + 2888741362.
It is an arithmetic number, because the mean of its divisors is an integer number (28887413440).
Almost surely, 2109772171053 is an apocalyptic number.
It is an amenable number.
109772171053 is a deficient number, since it is larger than the sum of its proper divisors (5777482707).
109772171053 is an equidigital number, since it uses as much as digits as its factorization.
109772171053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5777482706.
The product of its (nonzero) digits is 92610, while the sum is 43.
The spelling of 109772171053 in words is "one hundred nine billion, seven hundred seventy-two million, one hundred seventy-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •