Base | Representation |
---|---|
bin | 1100011111010… |
… | …11011101011111 |
3 | 21022011001011221 |
4 | 12033223131133 |
5 | 203310222341 |
6 | 14221354211 |
7 | 2411363005 |
oct | 617533537 |
9 | 238131157 |
10 | 104773471 |
11 | 54161950 |
12 | 2b108967 |
13 | 1892544a |
14 | dcb4a75 |
15 | 92e8ed1 |
hex | 63eb75f |
104773471 has 8 divisors (see below), whose sum is σ = 114961104. Its totient is φ = 94696320.
The previous prime is 104773447. The next prime is 104773477. The reversal of 104773471 is 174377401.
It is a happy number.
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 104773471 - 29 = 104772959 is a prime.
It is a super-3 number, since 3×1047734713 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104773477) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 25626 + ... + 29431.
It is an arithmetic number, because the mean of its divisors is an integer number (14370138).
Almost surely, 2104773471 is an apocalyptic number.
104773471 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
104773471 is a deficient number, since it is larger than the sum of its proper divisors (10187633).
104773471 is a wasteful number, since it uses less digits than its factorization.
104773471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55241.
The product of its (nonzero) digits is 16464, while the sum is 34.
The square root of 104773471 is about 10235.8913143898. The cubic root of 104773471 is about 471.4298856625.
The spelling of 104773471 in words is "one hundred four million, seven hundred seventy-three thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •