Base | Representation |
---|---|
bin | 110110010000100100… |
… | …0100111101001010100 |
3 | 102010202110222112202220 |
4 | 1230201020213221110 |
5 | 3402113111242120 |
6 | 125310100302340 |
7 | 11263321603464 |
oct | 1544110475124 |
9 | 363673875686 |
10 | 116520024660 |
11 | 45463575146 |
12 | 1a6ba3a19b0 |
13 | acac23c470 |
14 | 58d50bbba4 |
15 | 306e701b40 |
hex | 1b21227a54 |
116520024660 has 96 divisors (see below), whose sum is σ = 351534191232. Its totient is φ = 28667036160.
The previous prime is 116520024631. The next prime is 116520024671. The reversal of 116520024660 is 66420025611.
It is a super-2 number, since 2×1165200246602 (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 31 ways as a sum of consecutive naturals, for example, 1512270 + ... + 1587450.
It is an arithmetic number, because the mean of its divisors is an integer number (3661814492).
Almost surely, 2116520024660 is an apocalyptic number.
116520024660 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 116520024660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175767095616).
116520024660 is an abundant number, since it is smaller than the sum of its proper divisors (235014166572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116520024660 is a wasteful number, since it uses less digits than its factorization.
116520024660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77193 (or 77191 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 116520024660 in words is "one hundred sixteen billion, five hundred twenty million, twenty-four thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •