Base | Representation |
---|---|
bin | 110000110111111100… |
… | …0001000011001011011 |
3 | 101000220120121102020122 |
4 | 1201233320020121123 |
5 | 3204422241404124 |
6 | 120114411343455 |
7 | 10403624661521 |
oct | 1415770103133 |
9 | 330816542218 |
10 | 104956200539 |
11 | 4056a047a03 |
12 | 18411751b8b |
13 | 9b88574298 |
14 | 51193a0311 |
15 | 2ae43dd75e |
hex | 186fe0865b |
104956200539 has 8 divisors (see below), whose sum is σ = 107471738880. Its totient is φ = 102444057576.
The previous prime is 104956200523. The next prime is 104956200577. The reversal of 104956200539 is 935002659401.
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 104956200539 - 24 = 104956200523 is a prime.
It is a super-2 number, since 2×1049562005392 (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 104956200539.
It is not an unprimeable number, because it can be changed into a prime (104956200509) 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, 786227 + ... + 909980.
It is an arithmetic number, because the mean of its divisors is an integer number (13433967360).
Almost surely, 2104956200539 is an apocalyptic number.
104956200539 is a deficient number, since it is larger than the sum of its proper divisors (2515538341).
104956200539 is a wasteful number, since it uses less digits than its factorization.
104956200539 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1697689.
The product of its (nonzero) digits is 291600, while the sum is 44.
The spelling of 104956200539 in words is "one hundred four billion, nine hundred fifty-six million, two hundred thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •