Base | Representation |
---|---|
bin | 110110010000010001… |
… | …0111101001000000100 |
3 | 102010201210101220220011 |
4 | 1230200202331020010 |
5 | 3402103044314142 |
6 | 125305104520004 |
7 | 11263141642012 |
oct | 1544042751004 |
9 | 363653356804 |
10 | 116510151172 |
11 | 45458a41038 |
12 | 1a6b7020004 |
13 | acaa19336c |
14 | 58d3a6b8b2 |
15 | 306d901417 |
hex | 1b208bd204 |
116510151172 has 6 divisors (see below), whose sum is σ = 203892764558. Its totient is φ = 58255075584.
The previous prime is 116510151169. The next prime is 116510151187. The reversal of 116510151172 is 271151015611.
It can be written as a sum of positive squares in only one way, i.e., 106630983936 + 9879167236 = 326544^2 + 99394^2 .
It is a super-2 number, since 2×1165101511722 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14563768893 + ... + 14563768900.
Almost surely, 2116510151172 is an apocalyptic number.
It is an amenable number.
116510151172 is a deficient number, since it is larger than the sum of its proper divisors (87382613386).
116510151172 is a wasteful number, since it uses less digits than its factorization.
116510151172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29127537797 (or 29127537795 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 31.
Adding to 116510151172 its reverse (271151015611), we get a palindrome (387661166783).
The spelling of 116510151172 in words is "one hundred sixteen billion, five hundred ten million, one hundred fifty-one thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •