Base | Representation |
---|---|
bin | 110101111010010011… |
… | …1100011000110110000 |
3 | 102001211102121210001122 |
4 | 1223310213203012300 |
5 | 3344100412022213 |
6 | 125104020321412 |
7 | 11235652414220 |
oct | 1536447430660 |
9 | 361742553048 |
10 | 115773157808 |
11 | 4510aa25010 |
12 | 1a530243268 |
13 | abc05a0b09 |
14 | 5863c24080 |
15 | 3028d72d08 |
hex | 1af49e31b0 |
115773157808 has 160 divisors (see below), whose sum is σ = 284981760000. Its totient is φ = 44251234560.
The previous prime is 115773157777. The next prime is 115773157813. The reversal of 115773157808 is 808751377511.
It is a self number, because there is not a number n which added to its sum of digits gives 115773157808.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 43538783 + ... + 43541441.
It is an arithmetic number, because the mean of its divisors is an integer number (1781136000).
Almost surely, 2115773157808 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115773157808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142490880000).
115773157808 is an abundant number, since it is smaller than the sum of its proper divisors (169208602192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115773157808 is a wasteful number, since it uses less digits than its factorization.
115773157808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3343 (or 3337 counting only the distinct ones).
The product of its (nonzero) digits is 1646400, while the sum is 53.
The spelling of 115773157808 in words is "one hundred fifteen billion, seven hundred seventy-three million, one hundred fifty-seven thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •