Base | Representation |
---|---|
bin | 1100011001111… |
… | …01011101101101 |
3 | 21020210211120000 |
4 | 12030331131231 |
5 | 203114421111 |
6 | 14154214513 |
7 | 2402334126 |
oct | 614753555 |
9 | 236724500 |
10 | 104060781 |
11 | 53815450 |
12 | 2aa24439 |
13 | 18735c36 |
14 | db6b04d |
15 | 9207c56 |
hex | 633d76d |
104060781 has 20 divisors (see below), whose sum is σ = 169581984. Its totient is φ = 63066600.
The previous prime is 104060779. The next prime is 104060833. The reversal of 104060781 is 187060401.
It is a happy number.
104060781 is a `hidden beast` number, since 10 + 40 + 607 + 8 + 1 = 666.
It is not a de Polignac number, because 104060781 - 21 = 104060779 is a prime.
It is a super-2 number, since 2×1040607812 = 21657292284659922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104060771) 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 19 ways as a sum of consecutive naturals, for example, 57505 + ... + 59286.
Almost surely, 2104060781 is an apocalyptic number.
104060781 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104060781 is a deficient number, since it is larger than the sum of its proper divisors (65521203).
104060781 is a wasteful number, since it uses less digits than its factorization.
104060781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116814 (or 116805 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 104060781 is about 10201.0186256079. The cubic root of 104060781 is about 470.3585328268.
The spelling of 104060781 in words is "one hundred four million, sixty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •