Base | Representation |
---|---|
bin | 1100011101100… |
… | …10100101101011 |
3 | 21021201012122020 |
4 | 12032302211223 |
5 | 203230244043 |
6 | 14212355523 |
7 | 2406402603 |
oct | 616624553 |
9 | 237635566 |
10 | 104540523 |
11 | 5401292a |
12 | 2b015ba3 |
13 | 188733c9 |
14 | dc53c03 |
15 | 929ee83 |
hex | 63b296b |
104540523 has 4 divisors (see below), whose sum is σ = 139387368. Its totient is φ = 69693680.
The previous prime is 104540521. The next prime is 104540551. The reversal of 104540523 is 325045401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 325045401 = 3 ⋅108348467.
It is a cyclic number.
It is not a de Polignac number, because 104540523 - 21 = 104540521 is a prime.
It is a super-2 number, since 2×1045405232 = 21857441898227058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104540493 and 104540502.
It is not an unprimeable number, because it can be changed into a prime (104540521) 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, 17423418 + ... + 17423423.
It is an arithmetic number, because the mean of its divisors is an integer number (34846842).
Almost surely, 2104540523 is an apocalyptic number.
104540523 is a deficient number, since it is larger than the sum of its proper divisors (34846845).
104540523 is an equidigital number, since it uses as much as digits as its factorization.
104540523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34846844.
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 104540523 is about 10224.5060027368. The cubic root of 104540523 is about 471.0802420074.
Adding to 104540523 its reverse (325045401), we get a palindrome (429585924).
The spelling of 104540523 in words is "one hundred four million, five hundred forty thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •