Base | Representation |
---|---|
bin | 110000110111111100… |
… | …0001000011000110111 |
3 | 101000220120121102012022 |
4 | 1201233320020120313 |
5 | 3204422241404003 |
6 | 120114411343355 |
7 | 10403624661440 |
oct | 1415770103067 |
9 | 330816542168 |
10 | 104956200503 |
11 | 4056a047980 |
12 | 18411751b5b |
13 | 9b8857426b |
14 | 51193a02c7 |
15 | 2ae43dd738 |
hex | 186fe08637 |
104956200503 has 32 divisors (see below), whose sum is σ = 133714575360. Its totient is φ = 79998478560.
The previous prime is 104956200463. The next prime is 104956200509. The reversal of 104956200503 is 305002659401.
It is not a de Polignac number, because 104956200503 - 222 = 104952006199 is a prime.
It is a super-2 number, since 2×1049562005032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 7241618 + ... + 7256096.
It is an arithmetic number, because the mean of its divisors is an integer number (4178580480).
Almost surely, 2104956200503 is an apocalyptic number.
104956200503 is a deficient number, since it is larger than the sum of its proper divisors (28758374857).
104956200503 is a wasteful number, since it uses less digits than its factorization.
104956200503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16547.
The product of its (nonzero) digits is 32400, while the sum is 35.
Adding to 104956200503 its reverse (305002659401), we get a palindrome (409958859904).
The spelling of 104956200503 in words is "one hundred four billion, nine hundred fifty-six million, two hundred thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •