Base | Representation |
---|---|
bin | 110010010110100101… |
… | …1110111110000000101 |
3 | 101100002220221102012010 |
4 | 1210231023313300011 |
5 | 3232423330102221 |
6 | 121401505444433 |
7 | 10545422056515 |
oct | 1445513676005 |
9 | 340086842163 |
10 | 108132269061 |
11 | 41949935223 |
12 | 18b59340719 |
13 | a27358407b |
14 | 533b119845 |
15 | 2c2d160c76 |
hex | 192d2f7c05 |
108132269061 has 4 divisors (see below), whose sum is σ = 144176358752. Its totient is φ = 72088179372.
The previous prime is 108132269051. The next prime is 108132269081. The reversal of 108132269061 is 160962231801.
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.
It is not a de Polignac number, because 108132269061 - 234 = 90952399877 is a prime.
It is a super-2 number, since 2×1081322690612 (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 (108132269051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18022044841 + ... + 18022044846.
It is an arithmetic number, because the mean of its divisors is an integer number (36044089688).
Almost surely, 2108132269061 is an apocalyptic number.
It is an amenable number.
108132269061 is a deficient number, since it is larger than the sum of its proper divisors (36044089691).
108132269061 is an equidigital number, since it uses as much as digits as its factorization.
108132269061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36044089690.
The product of its (nonzero) digits is 31104, while the sum is 39.
The spelling of 108132269061 in words is "one hundred eight billion, one hundred thirty-two million, two hundred sixty-nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •