Base | Representation |
---|---|
bin | 110000110101101100… |
… | …1111001101011001011 |
3 | 101000201100102022122120 |
4 | 1201223121321223023 |
5 | 3204244034321201 |
6 | 120103131222323 |
7 | 10402024132143 |
oct | 1415331715313 |
9 | 330640368576 |
10 | 104881167051 |
11 | 40530759161 |
12 | 183b05a79a3 |
13 | 9b75b6267b |
14 | 510d42b923 |
15 | 2adca1b536 |
hex | 186b679acb |
104881167051 has 16 divisors (see below), whose sum is σ = 142010738688. Its totient is φ = 68837392800.
The previous prime is 104881167049. The next prime is 104881167119. The reversal of 104881167051 is 150761188401.
It is not a de Polignac number, because 104881167051 - 21 = 104881167049 is a prime.
It is a super-2 number, since 2×1048811670512 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104881166994 and 104881167012.
It is not an unprimeable number, because it can be changed into a prime (104881167851) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 200086 + ... + 499796.
It is an arithmetic number, because the mean of its divisors is an integer number (8875671168).
Almost surely, 2104881167051 is an apocalyptic number.
104881167051 is a deficient number, since it is larger than the sum of its proper divisors (37129571637).
104881167051 is a wasteful number, since it uses less digits than its factorization.
104881167051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301522.
The product of its (nonzero) digits is 53760, while the sum is 42.
The spelling of 104881167051 in words is "one hundred four billion, eight hundred eighty-one million, one hundred sixty-seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •