Base | Representation |
---|---|
bin | 110000101110111100… |
… | …0111011101000110011 |
3 | 101000010112202101220022 |
4 | 1201131320323220303 |
5 | 3203313012424111 |
6 | 120024431234055 |
7 | 10363301616443 |
oct | 1413570735063 |
9 | 330115671808 |
10 | 104654420531 |
11 | 40424768141 |
12 | 1834867892b |
13 | 9b3aba222b |
14 | 50cb286123 |
15 | 2ac7b7c2db |
hex | 185de3ba33 |
104654420531 has 8 divisors (see below), whose sum is σ = 109835857440. Its totient is φ = 99525587392.
The previous prime is 104654420449. The next prime is 104654420569. The reversal of 104654420531 is 135024456401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104654420531 - 222 = 104650226227 is a prime.
It is a super-2 number, since 2×1046544205312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104654420491 and 104654420500.
It is not an unprimeable number, because it can be changed into a prime (104654420831) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13146866 + ... + 13154823.
It is an arithmetic number, because the mean of its divisors is an integer number (13729482180).
Almost surely, 2104654420531 is an apocalyptic number.
104654420531 is a deficient number, since it is larger than the sum of its proper divisors (5181436909).
104654420531 is a wasteful number, since it uses less digits than its factorization.
104654420531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26301885.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 104654420531 its reverse (135024456401), we get a palindrome (239678876932).
The spelling of 104654420531 in words is "one hundred four billion, six hundred fifty-four million, four hundred twenty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •