Base | Representation |
---|---|
bin | 1100011001110… |
… | …01101110101001 |
3 | 21020210001120100 |
4 | 12030321232221 |
5 | 203113423411 |
6 | 14154020013 |
7 | 2402241411 |
oct | 614715651 |
9 | 236701510 |
10 | 104045481 |
11 | 53804a01 |
12 | 2aa17609 |
13 | 1872bc97 |
14 | db65641 |
15 | 9203456 |
hex | 6339ba9 |
104045481 has 6 divisors (see below), whose sum is σ = 150287930. Its totient is φ = 69363648.
The previous prime is 104045479. The next prime is 104045483. The reversal of 104045481 is 184540401.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (104045479) and next prime (104045483).
It can be written as a sum of positive squares in only one way, i.e., 80192025 + 23853456 = 8955^2 + 4884^2 .
It is not a de Polignac number, because 104045481 - 21 = 104045479 is a prime.
It is a super-2 number, since 2×1040454812 = 21650924233042722, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (104045483) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5780296 + ... + 5780313.
Almost surely, 2104045481 is an apocalyptic number.
It is an amenable number.
104045481 is a deficient number, since it is larger than the sum of its proper divisors (46242449).
104045481 is a wasteful number, since it uses less digits than its factorization.
104045481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11560615 (or 11560612 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 27.
The square root of 104045481 is about 10200.2686729321. The cubic root of 104045481 is about 470.3354795106.
Adding to 104045481 its reverse (184540401), we get a palindrome (288585882).
The spelling of 104045481 in words is "one hundred four million, forty-five thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •