Base | Representation |
---|---|
bin | 110110010000001011… |
… | …0000001010100110100 |
3 | 102010201120000122202201 |
4 | 1230200112001110310 |
5 | 3402101212314000 |
6 | 125304504114244 |
7 | 11263101060454 |
oct | 1544026012464 |
9 | 363646018681 |
10 | 116506760500 |
11 | 45457035629 |
12 | 1a6b5a65984 |
13 | aca9576c50 |
14 | 58d3427d64 |
15 | 306d48196a |
hex | 1b20581534 |
116506760500 has 192 divisors, whose sum is σ = 284195358720. Its totient is φ = 41428800000.
The previous prime is 116506760479. The next prime is 116506760537. The reversal of 116506760500 is 5067605611.
It is a self number, because there is not a number n which added to its sum of digits gives 116506760500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 141563089 + ... + 141563911.
It is an arithmetic number, because the mean of its divisors is an integer number (1480184160).
Almost surely, 2116506760500 is an apocalyptic number.
116506760500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 116506760500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142097679360).
116506760500 is an abundant number, since it is smaller than the sum of its proper divisors (167688598220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116506760500 is a wasteful number, since it uses less digits than its factorization.
116506760500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1635 (or 1623 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 37.
The spelling of 116506760500 in words is "one hundred sixteen billion, five hundred six million, seven hundred sixty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •