Base | Representation |
---|---|
bin | 110110001011111111… |
… | …0101000001001101110 |
3 | 102010100202221010120000 |
4 | 1230113332220021232 |
5 | 3401304300112400 |
6 | 125242532005130 |
7 | 11256445111401 |
oct | 1542776501156 |
9 | 363322833500 |
10 | 116366410350 |
11 | 45394894473 |
12 | 1a676a607a6 |
13 | ac86476418 |
14 | 58bc931d38 |
15 | 3060eab600 |
hex | 1b17fa826e |
116366410350 has 120 divisors (see below), whose sum is σ = 323453261208. Its totient is φ = 31018852800.
The previous prime is 116366410343. The next prime is 116366410361. The reversal of 116366410350 is 53014663611.
116366410350 is a `hidden beast` number, since 1 + 1 + 6 + 3 + 6 + 641 + 0 + 3 + 5 + 0 = 666.
It is a super-2 number, since 2×1163664103502 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 15698145 + ... + 15705555.
Almost surely, 2116366410350 is an apocalyptic number.
116366410350 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 116366410350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161726630604).
116366410350 is an abundant number, since it is smaller than the sum of its proper divisors (207086850858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116366410350 is a wasteful number, since it uses less digits than its factorization.
116366410350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11312 (or 11298 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The spelling of 116366410350 in words is "one hundred sixteen billion, three hundred sixty-six million, four hundred ten thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •