Base | Representation |
---|---|
bin | 110110010000011011… |
… | …0000100010001001101 |
3 | 102010202010211110022110 |
4 | 1230200312010101031 |
5 | 3402110340124130 |
6 | 125305404134233 |
7 | 11263232346264 |
oct | 1544066042115 |
9 | 363663743273 |
10 | 116515161165 |
11 | 45460853127 |
12 | 1a6b8837379 |
13 | acab228860 |
14 | 58d45b35db |
15 | 306e090ab0 |
hex | 1b20d8444d |
116515161165 has 32 divisors (see below), whose sum is σ = 201013021440. Its totient is φ = 57290328576.
The previous prime is 116515161163. The next prime is 116515161181. The reversal of 116515161165 is 561161515611.
It is not a de Polignac number, because 116515161165 - 21 = 116515161163 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116515161163) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 211537 + ... + 527046.
It is an arithmetic number, because the mean of its divisors is an integer number (6281656920).
Almost surely, 2116515161165 is an apocalyptic number.
116515161165 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116515161165 is a deficient number, since it is larger than the sum of its proper divisors (84497860275).
116515161165 is a wasteful number, since it uses less digits than its factorization.
116515161165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739413.
The product of its digits is 27000, while the sum is 39.
Adding to 116515161165 its reverse (561161515611), we get a palindrome (677676676776).
The spelling of 116515161165 in words is "one hundred sixteen billion, five hundred fifteen million, one hundred sixty-one thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •