Base | Representation |
---|---|
bin | 110000110010010011… |
… | …0101010001111000011 |
3 | 101000102101201122112020 |
4 | 1201210212222033003 |
5 | 3204030332234141 |
6 | 120043533532523 |
7 | 10366140261120 |
oct | 1414446521703 |
9 | 330371648466 |
10 | 104767071171 |
11 | 4048230a244 |
12 | 1837a344143 |
13 | 9b58324c09 |
14 | 50dc20b747 |
15 | 2ad29d0266 |
hex | 18649aa3c3 |
104767071171 has 32 divisors (see below), whose sum is σ = 164827238400. Its totient is φ = 57924339840.
The previous prime is 104767071161. The next prime is 104767071197. The reversal of 104767071171 is 171170767401.
It is not a de Polignac number, because 104767071171 - 26 = 104767071107 is a prime.
It is a super-2 number, since 2×1047670711712 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104767071151) 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, 4146645 + ... + 4171833.
It is an arithmetic number, because the mean of its divisors is an integer number (5150851200).
Almost surely, 2104767071171 is an apocalyptic number.
104767071171 is a deficient number, since it is larger than the sum of its proper divisors (60060167229).
104767071171 is a wasteful number, since it uses less digits than its factorization.
104767071171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31619.
The product of its (nonzero) digits is 57624, while the sum is 42.
The spelling of 104767071171 in words is "one hundred four billion, seven hundred sixty-seven million, seventy-one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •