Base | Representation |
---|---|
bin | 11000110100000100001001… |
… | …010110011000000010011101 |
3 | 112022101211010200202201000111 |
4 | 120310010021112120002131 |
5 | 103301000222101302022 |
6 | 1024034025220130021 |
7 | 31662311304103045 |
oct | 3064041126300235 |
9 | 468354120681014 |
10 | 109130980884637 |
11 | 31855209741598 |
12 | 102a6394836911 |
13 | 48b8013183a6a |
14 | 1cd3d79376725 |
15 | c93b31eb7477 |
hex | 63410959809d |
109130980884637 has 2 divisors, whose sum is σ = 109130980884638. Its totient is φ = 109130980884636.
The previous prime is 109130980884623. The next prime is 109130980884647. The reversal of 109130980884637 is 736488089031901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96500484253156 + 12630496631481 = 9823466^2 + 3553941^2 .
It is a cyclic number.
It is not a de Polignac number, because 109130980884637 - 227 = 109130846666909 is a prime.
It is a super-2 number, since 2×1091309808846372 (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 (109130980884647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54565490442318 + 54565490442319.
It is an arithmetic number, because the mean of its divisors is an integer number (54565490442319).
Almost surely, 2109130980884637 is an apocalyptic number.
It is an amenable number.
109130980884637 is a deficient number, since it is larger than the sum of its proper divisors (1).
109130980884637 is an equidigital number, since it uses as much as digits as its factorization.
109130980884637 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62705664, while the sum is 67.
The spelling of 109130980884637 in words is "one hundred nine trillion, one hundred thirty billion, nine hundred eighty million, eight hundred eighty-four thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •