Base | Representation |
---|---|
bin | 110000110010010100… |
… | …0100011000101001001 |
3 | 101000102102122210111220 |
4 | 1201210220203011021 |
5 | 3204030444104103 |
6 | 120043552312253 |
7 | 10366144422165 |
oct | 1414450430511 |
9 | 330372583456 |
10 | 104767566153 |
11 | 40482618118 |
12 | 1837a542689 |
13 | 9b584692c3 |
14 | 50dc2d9ca5 |
15 | 2ad2a7bc53 |
hex | 1864a23149 |
104767566153 has 8 divisors (see below), whose sum is σ = 147907152288. Its totient is φ = 65736512064.
The previous prime is 104767566107. The next prime is 104767566173. The reversal of 104767566153 is 351665767401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104767566153 - 26 = 104767566089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51), and also a Moran number because the ratio is a prime number: 2054266003 = 104767566153 / (1 + 0 + 4 + 7 + 6 + 7 + 5 + 6 + 6 + 1 + 5 + 3).
It is a junction number, because it is equal to n+sod(n) for n = 104767566096 and 104767566105.
It is not an unprimeable number, because it can be changed into a prime (104767566173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1027132951 + ... + 1027133052.
It is an arithmetic number, because the mean of its divisors is an integer number (18488394036).
Almost surely, 2104767566153 is an apocalyptic number.
It is an amenable number.
104767566153 is a deficient number, since it is larger than the sum of its proper divisors (43139586135).
104767566153 is a wasteful number, since it uses less digits than its factorization.
104767566153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2054266023.
The product of its (nonzero) digits is 3175200, while the sum is 51.
The spelling of 104767566153 in words is "one hundred four billion, seven hundred sixty-seven million, five hundred sixty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •