Base | Representation |
---|---|
bin | 110000100101010101… |
… | …1110101110001111101 |
3 | 100222022002111000000021 |
4 | 1201022223311301331 |
5 | 3202133022042230 |
6 | 115532441332141 |
7 | 10352310152035 |
oct | 1411253656175 |
9 | 328262430007 |
10 | 104332221565 |
11 | 40279901300 |
12 | 18278797051 |
13 | 9ab9201160 |
14 | 509a5748c5 |
15 | 2aa9735c7a |
hex | 184aaf5c7d |
104332221565 has 24 divisors (see below), whose sum is σ = 148200847704. Its totient is φ = 70041206400.
The previous prime is 104332221563. The next prime is 104332221611. The reversal of 104332221565 is 565122233401.
It can be written as a sum of positive squares in 4 ways, for example, as 469112281 + 103863109284 = 21659^2 + 322278^2 .
It is not a de Polignac number, because 104332221565 - 21 = 104332221563 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104332221565.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104332221563) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6624826 + ... + 6640555.
It is an arithmetic number, because the mean of its divisors is an integer number (6175035321).
Almost surely, 2104332221565 is an apocalyptic number.
It is an amenable number.
104332221565 is a deficient number, since it is larger than the sum of its proper divisors (43868626139).
104332221565 is a wasteful number, since it uses less digits than its factorization.
104332221565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13265421 (or 13265410 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 104332221565 its reverse (565122233401), we get a palindrome (669454454966).
The spelling of 104332221565 in words is "one hundred four billion, three hundred thirty-two million, two hundred twenty-one thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •