Base | Representation |
---|---|
bin | 110110010010111000… |
… | …0010100010100011100 |
3 | 102010221212211202000000 |
4 | 1230211300110110130 |
5 | 3402242432240444 |
6 | 125321505534300 |
7 | 11265252511212 |
oct | 1544560242434 |
9 | 363855752000 |
10 | 116597540124 |
11 | 454a32a970a |
12 | 1a720344390 |
13 | acc230c9c0 |
14 | 59014d8cb2 |
15 | 3076414469 |
hex | 1b25c1451c |
116597540124 has 168 divisors, whose sum is σ = 334869212832. Its totient is φ = 35287332480.
The previous prime is 116597540071. The next prime is 116597540183. The reversal of 116597540124 is 421045795611.
116597540124 is a `hidden beast` number, since 1 + 1 + 6 + 5 + 97 + 540 + 12 + 4 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 116597540124.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 2287177 + ... + 2337599.
It is an arithmetic number, because the mean of its divisors is an integer number (1993269124).
Almost surely, 2116597540124 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 116597540124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167434606416).
116597540124 is an abundant number, since it is smaller than the sum of its proper divisors (218271672708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116597540124 is a wasteful number, since it uses less digits than its factorization.
116597540124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50519 (or 50502 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 45.
The spelling of 116597540124 in words is "one hundred sixteen billion, five hundred ninety-seven million, five hundred forty thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •