Base | Representation |
---|---|
bin | 110000100101010110… |
… | …0001001101111100011 |
3 | 100222022002122011011122 |
4 | 1201022230021233203 |
5 | 3202133032201311 |
6 | 115532443202455 |
7 | 10352310642314 |
oct | 1411254115743 |
9 | 328262564148 |
10 | 104332303331 |
11 | 40279957783 |
12 | 1827881642b |
13 | 9ab922c439 |
14 | 509a59660b |
15 | 2aa97500db |
hex | 184ab09be3 |
104332303331 has 8 divisors (see below), whose sum is σ = 105816824064. Its totient is φ = 102848200840.
The previous prime is 104332303291. The next prime is 104332303333. The reversal of 104332303331 is 133303233401.
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 104332303331 - 26 = 104332303267 is a prime.
It is a super-2 number, since 2×1043323033312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 104332303331.
It is not an unprimeable number, because it can be changed into a prime (104332303333) 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, 416210 + ... + 617976.
It is an arithmetic number, because the mean of its divisors is an integer number (13227103008).
Almost surely, 2104332303331 is an apocalyptic number.
104332303331 is a deficient number, since it is larger than the sum of its proper divisors (1484520733).
104332303331 is an equidigital number, since it uses as much as digits as its factorization.
104332303331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209121.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 104332303331 its reverse (133303233401), we get a palindrome (237635536732).
The spelling of 104332303331 in words is "one hundred four billion, three hundred thirty-two million, three hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •