Base | Representation |
---|---|
bin | 110000100110111001… |
… | …1000010111111011101 |
3 | 100222102201202002102210 |
4 | 1201031303002333131 |
5 | 3202234404123313 |
6 | 115541544511033 |
7 | 10353513056133 |
oct | 1411563027735 |
9 | 328381662383 |
10 | 104384442333 |
11 | 402a6329566 |
12 | 1829217b479 |
13 | 9ac6c86312 |
14 | 50a3489753 |
15 | 2aae0ed9c3 |
hex | 184dcc2fdd |
104384442333 has 4 divisors (see below), whose sum is σ = 139179256448. Its totient is φ = 69589628220.
The previous prime is 104384442319. The next prime is 104384442359. The reversal of 104384442333 is 333244483401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 104384442333 - 222 = 104380248029 is a prime.
It is a super-2 number, since 2×1043844423332 (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 = 104384442291 and 104384442300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104384442313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17397407053 + ... + 17397407058.
It is an arithmetic number, because the mean of its divisors is an integer number (34794814112).
Almost surely, 2104384442333 is an apocalyptic number.
It is an amenable number.
104384442333 is a deficient number, since it is larger than the sum of its proper divisors (34794814115).
104384442333 is an equidigital number, since it uses as much as digits as its factorization.
104384442333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34794814114.
The product of its (nonzero) digits is 331776, while the sum is 39.
The spelling of 104384442333 in words is "one hundred four billion, three hundred eighty-four million, four hundred forty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •