Base | Representation |
---|---|
bin | 110001110110000101… |
… | …0001001001001011101 |
3 | 101020021220002021212002 |
4 | 1203230022021021131 |
5 | 3223210033000424 |
6 | 121101334252045 |
7 | 10506404004104 |
oct | 1435412111135 |
9 | 336256067762 |
10 | 107041296989 |
11 | 4143a026810 |
12 | 188b3ab7025 |
13 | a12b544673 |
14 | 527628b03b |
15 | 2bb74aecae |
hex | 18ec28925d |
107041296989 has 32 divisors (see below), whose sum is σ = 121129706880. Its totient is φ = 93749344000.
The previous prime is 107041296983. The next prime is 107041297009. The reversal of 107041296989 is 989692140701.
It is a cyclic number.
It is not a de Polignac number, because 107041296989 - 212 = 107041292893 is a prime.
It is a super-2 number, since 2×1070412969892 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107041296983) 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 in 31 ways as a sum of consecutive naturals, for example, 56306939 + ... + 56308839.
It is an arithmetic number, because the mean of its divisors is an integer number (3785303340).
Almost surely, 2107041296989 is an apocalyptic number.
It is an amenable number.
107041296989 is a deficient number, since it is larger than the sum of its proper divisors (14088409891).
107041296989 is a wasteful number, since it uses less digits than its factorization.
107041296989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3661.
The product of its (nonzero) digits is 1959552, while the sum is 56.
The spelling of 107041296989 in words is "one hundred seven billion, forty-one million, two hundred ninety-six thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •