Base | Representation |
---|---|
bin | 110000011111011010… |
… | …1011100101001000011 |
3 | 100221210020101111112111 |
4 | 1200332311130221003 |
5 | 3201231123212233 |
6 | 115501020240151 |
7 | 10344344260363 |
oct | 1407665345103 |
9 | 327706344474 |
10 | 104133413443 |
11 | 40187662874 |
12 | 182220a0057 |
13 | 9a86c73507 |
14 | 507bdc29a3 |
15 | 2a97064acd |
hex | 183ed5ca43 |
104133413443 has 8 divisors (see below), whose sum is σ = 105051448656. Its totient is φ = 103217244000.
The previous prime is 104133413413. The next prime is 104133413471. The reversal of 104133413443 is 344314331401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104133413443 - 29 = 104133412931 is a prime.
It is a super-2 number, since 2×1041334134432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104133413413) 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 in 7 ways as a sum of consecutive naturals, for example, 354208 + ... + 577693.
It is an arithmetic number, because the mean of its divisors is an integer number (13131431082).
Almost surely, 2104133413443 is an apocalyptic number.
104133413443 is a deficient number, since it is larger than the sum of its proper divisors (918035213).
104133413443 is an equidigital number, since it uses as much as digits as its factorization.
104133413443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 932885.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 104133413443 its reverse (344314331401), we get a palindrome (448447744844).
The spelling of 104133413443 in words is "one hundred four billion, one hundred thirty-three million, four hundred thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •