Base | Representation |
---|---|
bin | 110000101000100110… |
… | …0000011111011101011 |
3 | 100222120200210100121120 |
4 | 1201101030003323223 |
5 | 3202343440101220 |
6 | 115551340110323 |
7 | 10355103445440 |
oct | 1412114037353 |
9 | 328520710546 |
10 | 104441331435 |
11 | 40325455151 |
12 | 182a92353a3 |
13 | 9b059b42cc |
14 | 50aac579c7 |
15 | 2ab40d9a40 |
hex | 1851303eeb |
104441331435 has 32 divisors (see below), whose sum is σ = 191967997440. Its totient is φ = 47497218048.
The previous prime is 104441331433. The next prime is 104441331437. The reversal of 104441331435 is 534133144401.
It is an interprime number because it is at equal distance from previous prime (104441331433) and next prime (104441331437).
It is not a de Polignac number, because 104441331435 - 21 = 104441331433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104441331396 and 104441331405.
It is not an unprimeable number, because it can be changed into a prime (104441331431) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2556625 + ... + 2597154.
It is an arithmetic number, because the mean of its divisors is an integer number (5998999920).
Almost surely, 2104441331435 is an apocalyptic number.
104441331435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
104441331435 is a deficient number, since it is larger than the sum of its proper divisors (87526666005).
104441331435 is a wasteful number, since it uses less digits than its factorization.
104441331435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5153987.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 104441331435 its reverse (534133144401), we get a palindrome (638574475836).
The spelling of 104441331435 in words is "one hundred four billion, four hundred forty-one million, three hundred thirty-one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •