Base | Representation |
---|---|
bin | 110010000000010011… |
… | …1100110111011011101 |
3 | 101021011211000010200111 |
4 | 1210000213212323131 |
5 | 3224410422043334 |
6 | 121155355530021 |
7 | 10521042513616 |
oct | 1440047467335 |
9 | 337154003614 |
10 | 107384565469 |
11 | 415a5873475 |
12 | 1898aa59911 |
13 | a1846b18cc |
14 | 52a9ac4c0d |
15 | 2bd76b9064 |
hex | 19009e6edd |
107384565469 has 2 divisors, whose sum is σ = 107384565470. Its totient is φ = 107384565468.
The previous prime is 107384565467. The next prime is 107384565487. The reversal of 107384565469 is 964565483701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100990484100 + 6394081369 = 317790^2 + 79963^2 .
It is a cyclic number.
It is not a de Polignac number, because 107384565469 - 21 = 107384565467 is a prime.
It is a super-2 number, since 2×1073845654692 (a number of 23 digits) contains 22 as substring.
Together with 107384565467, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107384565467) 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, 53692282734 + 53692282735.
It is an arithmetic number, because the mean of its divisors is an integer number (53692282735).
Almost surely, 2107384565469 is an apocalyptic number.
It is an amenable number.
107384565469 is a deficient number, since it is larger than the sum of its proper divisors (1).
107384565469 is an equidigital number, since it uses as much as digits as its factorization.
107384565469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21772800, while the sum is 58.
The spelling of 107384565469 in words is "one hundred seven billion, three hundred eighty-four million, five hundred sixty-five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •