Base | Representation |
---|---|
bin | 110110001011111100… |
… | …1110101011101100001 |
3 | 102010100200120022100220 |
4 | 1230113321311131201 |
5 | 3401303434413040 |
6 | 125242445033253 |
7 | 11256431330112 |
oct | 1542771653541 |
9 | 363320508326 |
10 | 116365154145 |
11 | 45394106689 |
12 | 1a676555829 |
13 | ac861266c6 |
14 | 58bc6c6209 |
15 | 3060d0e2d0 |
hex | 1b17e75761 |
116365154145 has 8 divisors (see below), whose sum is σ = 186184246656. Its totient is φ = 62061415536.
The previous prime is 116365154141. The next prime is 116365154153. The reversal of 116365154145 is 541451563611.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116365154145 - 22 = 116365154141 is a prime.
It is a super-2 number, since 2×1163651541452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 116365154097 and 116365154106.
It is not an unprimeable number, because it can be changed into a prime (116365154141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3878838457 + ... + 3878838486.
It is an arithmetic number, because the mean of its divisors is an integer number (23273030832).
Almost surely, 2116365154145 is an apocalyptic number.
116365154145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116365154145 is a deficient number, since it is larger than the sum of its proper divisors (69819092511).
116365154145 is an equidigital number, since it uses as much as digits as its factorization.
116365154145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7757676951.
The product of its digits is 216000, while the sum is 42.
The spelling of 116365154145 in words is "one hundred sixteen billion, three hundred sixty-five million, one hundred fifty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •