Base | Representation |
---|---|
bin | 110001110101011100… |
… | …0100100101100111111 |
3 | 101020020101211220222021 |
4 | 1203222320210230333 |
5 | 3223134044222142 |
6 | 121055252101011 |
7 | 10506024155134 |
oct | 1435270445477 |
9 | 336211756867 |
10 | 107019914047 |
11 | 41428a51462 |
12 | 188a8904767 |
13 | a126c98937 |
14 | 52734c258b |
15 | 2bb5689267 |
hex | 18eae24b3f |
107019914047 has 2 divisors, whose sum is σ = 107019914048. Its totient is φ = 107019914046.
The previous prime is 107019914017. The next prime is 107019914119. The reversal of 107019914047 is 740419910701.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107019914047 is a prime.
It is a super-2 number, since 2×1070199140472 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 107019913994 and 107019914012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107019914017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53509957023 + 53509957024.
It is an arithmetic number, because the mean of its divisors is an integer number (53509957024).
Almost surely, 2107019914047 is an apocalyptic number.
107019914047 is a deficient number, since it is larger than the sum of its proper divisors (1).
107019914047 is an equidigital number, since it uses as much as digits as its factorization.
107019914047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63504, while the sum is 43.
The spelling of 107019914047 in words is "one hundred seven billion, nineteen million, nine hundred fourteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •