Base | Representation |
---|---|
bin | 11000110100000100000001… |
… | …010110011000000010010111 |
3 | 112022101210210100012201220022 |
4 | 120310010001112120002113 |
5 | 103300444433221320103 |
6 | 1024034004023255355 |
7 | 31662305054214515 |
oct | 3064040126300227 |
9 | 468353710181808 |
10 | 109130846666903 |
11 | 3185514a9a9846 |
12 | 102a63578aa55b |
13 | 48b7cc141c599 |
14 | 1cd3d655d94b5 |
15 | c93b25304138 |
hex | 634101598097 |
109130846666903 has 2 divisors, whose sum is σ = 109130846666904. Its totient is φ = 109130846666902.
The previous prime is 109130846666899. The next prime is 109130846666909. The reversal of 109130846666903 is 309666648031901.
It is a weak prime.
It is an emirp because it is prime and its reverse (309666648031901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109130846666903 - 22 = 109130846666899 is a prime.
It is a super-2 number, since 2×1091308466669032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109130846666909) 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 as a sum of consecutive naturals, namely, 54565423333451 + 54565423333452.
It is an arithmetic number, because the mean of its divisors is an integer number (54565423333452).
Almost surely, 2109130846666903 is an apocalyptic number.
109130846666903 is a deficient number, since it is larger than the sum of its proper divisors (1).
109130846666903 is an equidigital number, since it uses as much as digits as its factorization.
109130846666903 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30233088, while the sum is 62.
The spelling of 109130846666903 in words is "one hundred nine trillion, one hundred thirty billion, eight hundred forty-six million, six hundred sixty-six thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •