Base | Representation |
---|---|
bin | 110000101011001011… |
… | …1011010111010111111 |
3 | 100222210202020111101101 |
4 | 1201112113122322333 |
5 | 3203033204222023 |
6 | 120004121553531 |
7 | 10360206666652 |
oct | 1412627327277 |
9 | 328722214341 |
10 | 104528195263 |
11 | 4036a494238 |
12 | 183123458a7 |
13 | 9b1a9a891b |
14 | 50b85c9899 |
15 | 2abba471ad |
hex | 18565daebf |
104528195263 has 4 divisors (see below), whose sum is σ = 104538133440. Its totient is φ = 104518257088.
The previous prime is 104528195207. The next prime is 104528195333. The reversal of 104528195263 is 362591825401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 362591825401 = 13 ⋅27891678877.
It is a cyclic number.
It is not a de Polignac number, because 104528195263 - 29 = 104528194751 is a prime.
It is a super-2 number, since 2×1045281952632 (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 (104528195363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4953295 + ... + 4974352.
It is an arithmetic number, because the mean of its divisors is an integer number (26134533360).
Almost surely, 2104528195263 is an apocalyptic number.
104528195263 is a deficient number, since it is larger than the sum of its proper divisors (9938177).
104528195263 is an equidigital number, since it uses as much as digits as its factorization.
104528195263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9938176.
The product of its (nonzero) digits is 518400, while the sum is 46.
The spelling of 104528195263 in words is "one hundred four billion, five hundred twenty-eight million, one hundred ninety-five thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •