Base | Representation |
---|---|
bin | 110010111111001100… |
… | …1000100001000010011 |
3 | 101110121212120011120110 |
4 | 1211332121010020103 |
5 | 3243221114312011 |
6 | 122145015012403 |
7 | 10624244304342 |
oct | 1457631041023 |
9 | 343555504513 |
10 | 109494682131 |
11 | 4248899133a |
12 | 1927966a103 |
13 | a42c902453 |
14 | 542a045b59 |
15 | 2caca7dba6 |
hex | 197e644213 |
109494682131 has 4 divisors (see below), whose sum is σ = 145992909512. Its totient is φ = 72996454752.
The previous prime is 109494682127. The next prime is 109494682153. The reversal of 109494682131 is 131286494901.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 109494682131 - 22 = 109494682127 is a prime.
It is a super-2 number, since 2×1094946821312 (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 (109494682111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18249113686 + ... + 18249113691.
It is an arithmetic number, because the mean of its divisors is an integer number (36498227378).
Almost surely, 2109494682131 is an apocalyptic number.
109494682131 is a deficient number, since it is larger than the sum of its proper divisors (36498227381).
109494682131 is an equidigital number, since it uses as much as digits as its factorization.
109494682131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36498227380.
The product of its (nonzero) digits is 373248, while the sum is 48.
The spelling of 109494682131 in words is "one hundred nine billion, four hundred ninety-four million, six hundred eighty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •