Base | Representation |
---|---|
bin | 110000100111011101… |
… | …1011101011111011001 |
3 | 100222111001110112002110 |
4 | 1201032323131133121 |
5 | 3202304234101431 |
6 | 115543503422533 |
7 | 10354133320653 |
oct | 1411673353731 |
9 | 328431415073 |
10 | 104403425241 |
11 | 40306014715 |
12 | 182985b4a49 |
13 | 9acaba17cb |
14 | 50a5bcb6d3 |
15 | 2ab0aed346 |
hex | 184eedd7d9 |
104403425241 has 8 divisors (see below), whose sum is σ = 139571862880. Its totient is φ = 69418635552.
The previous prime is 104403425209. The next prime is 104403425267. The reversal of 104403425241 is 142524304401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104403425241 - 25 = 104403425209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104403425199 and 104403425208.
It is not an unprimeable number, because it can be changed into a prime (104403426241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45910660 + ... + 45912933.
It is an arithmetic number, because the mean of its divisors is an integer number (17446482860).
Almost surely, 2104403425241 is an apocalyptic number.
It is an amenable number.
104403425241 is a deficient number, since it is larger than the sum of its proper divisors (35168437639).
104403425241 is an equidigital number, since it uses as much as digits as its factorization.
104403425241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91823975.
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 104403425241 its reverse (142524304401), we get a palindrome (246927729642).
The spelling of 104403425241 in words is "one hundred four billion, four hundred three million, four hundred twenty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •