Base | Representation |
---|---|
bin | 110000011101000000… |
… | …0001000111101111011 |
3 | 100221120120211001110110 |
4 | 1200322000020331323 |
5 | 3201044344032423 |
6 | 115445002315403 |
7 | 10342341133512 |
oct | 1407200107573 |
9 | 327516731413 |
10 | 104052330363 |
11 | 40145911963 |
12 | 181baab8b63 |
13 | 9a73224167 |
14 | 5071317679 |
15 | 2a8ed9a193 |
hex | 183a008f7b |
104052330363 has 8 divisors (see below), whose sum is σ = 138796534800. Its totient is φ = 69338173088.
The previous prime is 104052330329. The next prime is 104052330373. The reversal of 104052330363 is 363033250401.
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 104052330363 - 26 = 104052330299 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104052330363.
It is not an unprimeable number, because it can be changed into a prime (104052330373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7503708 + ... + 7517561.
It is an arithmetic number, because the mean of its divisors is an integer number (17349566850).
Almost surely, 2104052330363 is an apocalyptic number.
104052330363 is a deficient number, since it is larger than the sum of its proper divisors (34744204437).
104052330363 is a wasteful number, since it uses less digits than its factorization.
104052330363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15023581.
The product of its (nonzero) digits is 19440, while the sum is 30.
Adding to 104052330363 its reverse (363033250401), we get a palindrome (467085580764).
The spelling of 104052330363 in words is "one hundred four billion, fifty-two million, three hundred thirty thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •