Base | Representation |
---|---|
bin | 110000011100011101… |
… | …0010011111110000110 |
3 | 100221112022101001201000 |
4 | 1200320322103332012 |
5 | 3201030202302400 |
6 | 115443110114130 |
7 | 10342026424233 |
oct | 1407072237606 |
9 | 327468331630 |
10 | 104034025350 |
11 | 4013654a052 |
12 | 181b494b946 |
13 | 9a6c4b53a8 |
14 | 506cb1078a |
15 | 2a8d481600 |
hex | 1838e93f86 |
104034025350 has 96 divisors (see below), whose sum is σ = 303534635040. Its totient is φ = 26110494720.
The previous prime is 104034025321. The next prime is 104034025387. The reversal of 104034025350 is 53520430401.
104034025350 is a `hidden beast` number, since 1 + 0 + 403 + 4 + 0 + 253 + 5 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2243587 + ... + 2289486.
It is an arithmetic number, because the mean of its divisors is an integer number (3161819115).
Almost surely, 2104034025350 is an apocalyptic number.
104034025350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104034025350 is an abundant number, since it is smaller than the sum of its proper divisors (199500609690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104034025350 is a wasteful number, since it uses less digits than its factorization.
104034025350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4533111 (or 4533100 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
Adding to 104034025350 its reverse (53520430401), we get a palindrome (157554455751).
The spelling of 104034025350 in words is "one hundred four billion, thirty-four million, twenty-five thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •