Base | Representation |
---|---|
bin | 110110010000000001… |
… | …0100110110100101111 |
3 | 102010201012110002120200 |
4 | 1230200002212310233 |
5 | 3402043411434330 |
6 | 125304203044543 |
7 | 11263006603056 |
oct | 1544002466457 |
9 | 363635402520 |
10 | 116501671215 |
11 | 45454179a06 |
12 | 1a6b4210753 |
13 | aca84b4637 |
14 | 58d28a139d |
15 | 306ccc8a60 |
hex | 1b200a6d2f |
116501671215 has 24 divisors (see below), whose sum is σ = 202262508240. Its totient is φ = 62033831424.
The previous prime is 116501671207. The next prime is 116501671267. The reversal of 116501671215 is 512176105611.
It is not a de Polignac number, because 116501671215 - 23 = 116501671207 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116501671215.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2063362 + ... + 2119071.
It is an arithmetic number, because the mean of its divisors is an integer number (8427604510).
Almost surely, 2116501671215 is an apocalyptic number.
116501671215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
116501671215 is a deficient number, since it is larger than the sum of its proper divisors (85760837025).
116501671215 is a wasteful number, since it uses less digits than its factorization.
116501671215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4183063 (or 4183060 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 36.
Adding to 116501671215 its reverse (512176105611), we get a palindrome (628677776826).
The spelling of 116501671215 in words is "one hundred sixteen billion, five hundred one million, six hundred seventy-one thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •