Base | Representation |
---|---|
bin | 110110000010010010… |
… | …1011011001101101010 |
3 | 102002112002200102202020 |
4 | 1230010211123031222 |
5 | 3400123001133100 |
6 | 125150350045310 |
7 | 11245414352130 |
oct | 1540445331552 |
9 | 362462612666 |
10 | 116041036650 |
11 | 4523815a390 |
12 | 1a5a5aa9836 |
13 | ac33c332c6 |
14 | 588b635750 |
15 | 30426395a0 |
hex | 1b0495b36a |
116041036650 has 384 divisors, whose sum is σ = 364228116480. Its totient is φ = 23750496000.
The previous prime is 116041036633. The next prime is 116041036651. The reversal of 116041036650 is 56630140611.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (116041036651) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 350576985 + ... + 350577315.
It is an arithmetic number, because the mean of its divisors is an integer number (948510720).
Almost surely, 2116041036650 is an apocalyptic number.
116041036650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 116041036650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182114058240).
116041036650 is an abundant number, since it is smaller than the sum of its proper divisors (248187079830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116041036650 is a wasteful number, since it uses less digits than its factorization.
116041036650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 730 (or 725 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The spelling of 116041036650 in words is "one hundred sixteen billion, forty-one million, thirty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •