Base | Representation |
---|---|
bin | 110000011100011000… |
… | …0111010101100100101 |
3 | 100221112010201221100120 |
4 | 1200320300322230211 |
5 | 3201024040000113 |
6 | 115442541232153 |
7 | 10341666456063 |
oct | 1407060725445 |
9 | 327463657316 |
10 | 104031562533 |
11 | 40135117768 |
12 | 181b3b62659 |
13 | 9a6bb323c2 |
14 | 506c66d033 |
15 | 2a8d146a23 |
hex | 1838c3ab25 |
104031562533 has 8 divisors (see below), whose sum is σ = 138788428896. Its totient is φ = 69314535600.
The previous prime is 104031562519. The next prime is 104031562541. The reversal of 104031562533 is 335265130401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104031562533 - 24 = 104031562517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104031562494 and 104031562503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104031562513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9953763 + ... + 9964208.
It is an arithmetic number, because the mean of its divisors is an integer number (17348553612).
Almost surely, 2104031562533 is an apocalyptic number.
It is an amenable number.
104031562533 is a deficient number, since it is larger than the sum of its proper divisors (34756866363).
104031562533 is a wasteful number, since it uses less digits than its factorization.
104031562533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19919715.
The product of its (nonzero) digits is 32400, while the sum is 33.
Adding to 104031562533 its reverse (335265130401), we get a palindrome (439296692934).
The spelling of 104031562533 in words is "one hundred four billion, thirty-one million, five hundred sixty-two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •