Base | Representation |
---|---|
bin | 110000100111101011… |
… | …0001100011100101011 |
3 | 100222111112122120101001 |
4 | 1201033112030130223 |
5 | 3202313032331243 |
6 | 115544313535431 |
7 | 10354250016460 |
oct | 1411726143453 |
9 | 328445576331 |
10 | 104410433323 |
11 | 40309a70a19 |
12 | 1829aa14577 |
13 | 9acc4865c1 |
14 | 50a6ad3667 |
15 | 2ab1534a4d |
hex | 184f58c72b |
104410433323 has 8 divisors (see below), whose sum is σ = 119406145248. Its totient is φ = 89434705344.
The previous prime is 104410433317. The next prime is 104410433327. The reversal of 104410433323 is 323334014401.
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 104410433323 - 225 = 104376878891 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104410433291 and 104410433300.
It is not an unprimeable number, because it can be changed into a prime (104410433327) 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, 4984786 + ... + 5005687.
It is an arithmetic number, because the mean of its divisors is an integer number (14925768156).
Almost surely, 2104410433323 is an apocalyptic number.
104410433323 is a deficient number, since it is larger than the sum of its proper divisors (14995711925).
104410433323 is an equidigital number, since it uses as much as digits as its factorization.
104410433323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9991973.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 104410433323 its reverse (323334014401), we get a palindrome (427744447724).
The spelling of 104410433323 in words is "one hundred four billion, four hundred ten million, four hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •