Base | Representation |
---|---|
bin | 1100011011001… |
… | …01001100100101 |
3 | 21021010002210120 |
4 | 12031211030211 |
5 | 203140123100 |
6 | 14201512153 |
7 | 2403612450 |
oct | 615451445 |
9 | 237102716 |
10 | 104223525 |
11 | 5391674a |
12 | 2aaa2659 |
13 | 18792033 |
14 | dbb0497 |
15 | 923b0a0 |
hex | 6365325 |
104223525 has 48 divisors (see below), whose sum is σ = 199939584. Its totient is φ = 46918080.
The previous prime is 104223521. The next prime is 104223541. The reversal of 104223525 is 525322401.
It is not a de Polignac number, because 104223525 - 22 = 104223521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104223495 and 104223504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104223521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 33694 + ... + 36656.
It is an arithmetic number, because the mean of its divisors is an integer number (4165408).
Almost surely, 2104223525 is an apocalyptic number.
104223525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
104223525 is a deficient number, since it is larger than the sum of its proper divisors (95716059).
104223525 is a wasteful number, since it uses less digits than its factorization.
104223525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3050 (or 3045 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 104223525 is about 10208.9923596798. The cubic root of 104223525 is about 470.6036080533.
Adding to 104223525 its reverse (525322401), we get a palindrome (629545926).
The spelling of 104223525 in words is "one hundred four million, two hundred twenty-three thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •