Base | Representation |
---|---|
bin | 110010110011001100… |
… | …0010000111001111011 |
3 | 101102120210111121102121 |
4 | 1211212120100321323 |
5 | 3241410001203011 |
6 | 122041024142111 |
7 | 10611253106551 |
oct | 1454630207173 |
9 | 342523447377 |
10 | 109091819131 |
11 | 422a1540409 |
12 | 19186767937 |
13 | a3972ca989 |
14 | 53cc737bd1 |
15 | 2c87501e71 |
hex | 1966610e7b |
109091819131 has 2 divisors, whose sum is σ = 109091819132. Its totient is φ = 109091819130.
The previous prime is 109091819099. The next prime is 109091819147. The reversal of 109091819131 is 131918190901.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 109091819131 - 25 = 109091819099 is a prime.
It is a super-2 number, since 2×1090918191312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (109091811131) 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 as a sum of consecutive naturals, namely, 54545909565 + 54545909566.
It is an arithmetic number, because the mean of its divisors is an integer number (54545909566).
Almost surely, 2109091819131 is an apocalyptic number.
109091819131 is a deficient number, since it is larger than the sum of its proper divisors (1).
109091819131 is an equidigital number, since it uses as much as digits as its factorization.
109091819131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 43.
The spelling of 109091819131 in words is "one hundred nine billion, ninety-one million, eight hundred nineteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •