Base | Representation |
---|---|
bin | 1100011111110… |
… | …11110101010011 |
3 | 21022021110011122 |
4 | 12033323311103 |
5 | 203314344111 |
6 | 14223032455 |
7 | 2412062345 |
oct | 617736523 |
9 | 238243148 |
10 | 104840531 |
11 | 541a8274 |
12 | 2b13b72b |
13 | 18949b23 |
14 | dcd1295 |
15 | 930dcdb |
hex | 63fbd53 |
104840531 has 2 divisors, whose sum is σ = 104840532. Its totient is φ = 104840530.
The previous prime is 104840521. The next prime is 104840569. The reversal of 104840531 is 135048401.
It is a weak prime.
It is an emirp because it is prime and its reverse (135048401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104840531 - 26 = 104840467 is a prime.
It is a super-2 number, since 2×1048405312 = 21983073880723922, which contains 22 as substring.
It is a Chen prime.
It is equal to p6024086 and since 104840531 and 6024086 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104840531.
It is not a weakly prime, because it can be changed into another prime (104840521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52420265 + 52420266.
It is an arithmetic number, because the mean of its divisors is an integer number (52420266).
Almost surely, 2104840531 is an apocalyptic number.
104840531 is a deficient number, since it is larger than the sum of its proper divisors (1).
104840531 is an equidigital number, since it uses as much as digits as its factorization.
104840531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 104840531 is about 10239.1665188139. The cubic root of 104840531 is about 471.5304433876.
Adding to 104840531 its reverse (135048401), we get a palindrome (239888932).
The spelling of 104840531 in words is "one hundred four million, eight hundred forty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •