Base | Representation |
---|---|
bin | 110000101011010001… |
… | …1011001010001011011 |
3 | 100222210222010222020121 |
4 | 1201112203121101123 |
5 | 3203040010143420 |
6 | 120004313134111 |
7 | 10360245452326 |
oct | 1412643312133 |
9 | 328728128217 |
10 | 104531334235 |
11 | 40371238629 |
12 | 183133ba337 |
13 | 9b1b5375c3 |
14 | 50b8ba57bd |
15 | 2abbe672aa |
hex | 18568d945b |
104531334235 has 4 divisors (see below), whose sum is σ = 125437601088. Its totient is φ = 83625067384.
The previous prime is 104531334209. The next prime is 104531334239. The reversal of 104531334235 is 532433135401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 532433135401 = 47 ⋅11328364583.
It is a cyclic number.
It is not a de Polignac number, because 104531334235 - 25 = 104531334203 is a prime.
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 104531334235.
It is not an unprimeable number, because it can be changed into a prime (104531334239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10453133419 + ... + 10453133428.
It is an arithmetic number, because the mean of its divisors is an integer number (31359400272).
Almost surely, 2104531334235 is an apocalyptic number.
104531334235 is a deficient number, since it is larger than the sum of its proper divisors (20906266853).
104531334235 is an equidigital number, since it uses as much as digits as its factorization.
104531334235 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20906266852.
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 104531334235 its reverse (532433135401), we get a palindrome (636964469636).
The spelling of 104531334235 in words is "one hundred four billion, five hundred thirty-one million, three hundred thirty-four thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •