Base | Representation |
---|---|
bin | 110000110101111100… |
… | …0010000110010011011 |
3 | 101000201220101200100001 |
4 | 1201223320100302123 |
5 | 3204303104013133 |
6 | 120104013553431 |
7 | 10402151601202 |
oct | 1415370206233 |
9 | 330656350301 |
10 | 104889126043 |
11 | 405351a4939 |
12 | 183b31a5877 |
13 | 9b776bb230 |
14 | 5110500239 |
15 | 2add58e87d |
hex | 186be10c9b |
104889126043 has 8 divisors (see below), whose sum is σ = 115584440048. Its totient is φ = 94569086304.
The previous prime is 104889126029. The next prime is 104889126053. The reversal of 104889126043 is 340621988401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104889126043 is a prime.
It is a super-2 number, since 2×1048891260432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104889125984 and 104889126002.
It is not an unprimeable number, because it can be changed into a prime (104889126053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93817980 + ... + 93819097.
It is an arithmetic number, because the mean of its divisors is an integer number (14448055006).
Almost surely, 2104889126043 is an apocalyptic number.
104889126043 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
104889126043 is a deficient number, since it is larger than the sum of its proper divisors (10695314005).
104889126043 is a wasteful number, since it uses less digits than its factorization.
104889126043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187637133.
The product of its (nonzero) digits is 331776, while the sum is 46.
The spelling of 104889126043 in words is "one hundred four billion, eight hundred eighty-nine million, one hundred twenty-six thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •