Base | Representation |
---|---|
bin | 110010110001000100… |
… | …0011011100000001011 |
3 | 101102101211102020102020 |
4 | 1211202020123200023 |
5 | 3241233230344441 |
6 | 122030000535523 |
7 | 10606426315263 |
oct | 1454210334013 |
9 | 342354366366 |
10 | 109020559371 |
11 | 42265299949 |
12 | 191669215a3 |
13 | a38560a939 |
14 | 53c30a87a3 |
15 | 2c81127e66 |
hex | 196221b80b |
109020559371 has 4 divisors (see below), whose sum is σ = 145360745832. Its totient is φ = 72680372912.
The previous prime is 109020559313. The next prime is 109020559381. The reversal of 109020559371 is 173955020901.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 173955020901 = 3 ⋅57985006967.
It is a cyclic number.
It is not a de Polignac number, because 109020559371 - 211 = 109020557323 is a prime.
It is not an unprimeable number, because it can be changed into a prime (109020559301) 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, 18170093226 + ... + 18170093231.
It is an arithmetic number, because the mean of its divisors is an integer number (36340186458).
Almost surely, 2109020559371 is an apocalyptic number.
109020559371 is a deficient number, since it is larger than the sum of its proper divisors (36340186461).
109020559371 is an equidigital number, since it uses as much as digits as its factorization.
109020559371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36340186460.
The product of its (nonzero) digits is 85050, while the sum is 42.
The spelling of 109020559371 in words is "one hundred nine billion, twenty million, five hundred fifty-nine thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •