Base | Representation |
---|---|
bin | 1100011111100… |
… | …01000000001001 |
3 | 21022012012022121 |
4 | 12033301000021 |
5 | 203311434134 |
6 | 14222051241 |
7 | 2411516122 |
oct | 617610011 |
9 | 238165277 |
10 | 104796169 |
11 | 54177a05 |
12 | 2b119b21 |
13 | 1893288a |
14 | dcbd049 |
15 | 9300ab4 |
hex | 63f1009 |
104796169 has 9 divisors (see below), whose sum is σ = 108842773. Its totient is φ = 100895872.
The previous prime is 104796163. The next prime is 104796179. The reversal of 104796169 is 961697401.
It is a happy number.
The square root of 104796169 is 10237.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 511225 + 104284944 = 715^2 + 10212^2 .
It is a de Polignac number, because none of the positive numbers 2k-104796169 is a prime.
It is a super-2 number, since 2×1047961692 = 21964474074153122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104796163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 296697 + ... + 297049.
Almost surely, 2104796169 is an apocalyptic number.
104796169 is the 10237-th square number.
104796169 is the 5119-th centered octagonal number.
It is an amenable number.
104796169 is a deficient number, since it is larger than the sum of its proper divisors (4046604).
104796169 is an frugal number, since it uses more digits than its factorization.
104796169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764 (or 382 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 43.
The cubic root of 104796169 is about 471.4639265408.
The spelling of 104796169 in words is "one hundred four million, seven hundred ninety-six thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •