Base | Representation |
---|---|
bin | 110000001111100001… |
… | …1011101100001100001 |
3 | 100220102002002021101000 |
4 | 1200133003131201201 |
5 | 3144133123404121 |
6 | 115332052102213 |
7 | 10325211210351 |
oct | 1403703354141 |
9 | 326362067330 |
10 | 103600216161 |
11 | 3aa33691862 |
12 | 180b3604969 |
13 | 9a00667070 |
14 | 502b268b61 |
15 | 2a65340526 |
hex | 181f0dd861 |
103600216161 has 32 divisors (see below), whose sum is σ = 167755118720. Its totient is φ = 62802412992.
The previous prime is 103600216151. The next prime is 103600216169. The reversal of 103600216161 is 161612006301.
103600216161 is a `hidden beast` number, since 10 + 36 + 0 + 0 + 2 + 1 + 616 + 1 = 666.
It is not a de Polignac number, because 103600216161 - 27 = 103600216033 is a prime.
It is a super-3 number, since 3×1036002161613 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103600216169) 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 31 ways as a sum of consecutive naturals, for example, 2179150 + ... + 2226183.
It is an arithmetic number, because the mean of its divisors is an integer number (5242347460).
Almost surely, 2103600216161 is an apocalyptic number.
It is an amenable number.
103600216161 is a deficient number, since it is larger than the sum of its proper divisors (64154902559).
103600216161 is a wasteful number, since it uses less digits than its factorization.
103600216161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4405422 (or 4405416 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The spelling of 103600216161 in words is "one hundred three billion, six hundred million, two hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •