Base | Representation |
---|---|
bin | 110000101010010110… |
… | …1100001000100111101 |
3 | 100222201211000001000022 |
4 | 1201110231201010331 |
5 | 3203004102330323 |
6 | 120001250541525 |
7 | 10356422012021 |
oct | 1412455410475 |
9 | 328654001008 |
10 | 104500433213 |
11 | 403558521a0 |
12 | 18304b978a5 |
13 | 9b15008487 |
14 | 50b4a40381 |
15 | 2ab93b14c8 |
hex | 1854b6113d |
104500433213 has 4 divisors (see below), whose sum is σ = 114000472608. Its totient is φ = 95000393820.
The previous prime is 104500433189. The next prime is 104500433263. The reversal of 104500433213 is 312334005401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 104500433213 - 216 = 104500367677 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104500433263) 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 3 ways as a sum of consecutive naturals, for example, 4750019681 + ... + 4750019702.
It is an arithmetic number, because the mean of its divisors is an integer number (28500118152).
Almost surely, 2104500433213 is an apocalyptic number.
It is an amenable number.
104500433213 is a deficient number, since it is larger than the sum of its proper divisors (9500039395).
104500433213 is an equidigital number, since it uses as much as digits as its factorization.
104500433213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9500039394.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 104500433213 its reverse (312334005401), we get a palindrome (416834438614).
The spelling of 104500433213 in words is "one hundred four billion, five hundred million, four hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •