Base | Representation |
---|---|
bin | 110110001110101111… |
… | …1010001100011010011 |
3 | 102010121012212210020112 |
4 | 1230131133101203103 |
5 | 3402001431321421 |
6 | 125300033231535 |
7 | 11261646634241 |
oct | 1543537214323 |
9 | 363535783215 |
10 | 116458854611 |
11 | 45431a95190 |
12 | 1a6a1a025ab |
13 | ac9c672a78 |
14 | 58cad17791 |
15 | 306916c45b |
hex | 1b1d7d18d3 |
116458854611 has 8 divisors (see below), whose sum is σ = 129128745648. Its totient is φ = 104136084000.
The previous prime is 116458854601. The next prime is 116458854661.
116458854611 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116458854611 is a prime.
It is a super-2 number, since 2×1164588546112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116458854611.
It is not an unprimeable number, because it can be changed into a prime (116458854601) 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, 86779400 + ... + 86780741.
It is an arithmetic number, because the mean of its divisors is an integer number (16141093206).
Almost surely, 2116458854611 is an apocalyptic number.
116458854611 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
116458854611 is a deficient number, since it is larger than the sum of its proper divisors (12669891037).
116458854611 is a wasteful number, since it uses less digits than its factorization.
116458854611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173560213.
The product of its digits is 921600, while the sum is 50.
The spelling of 116458854611 in words is "one hundred sixteen billion, four hundred fifty-eight million, eight hundred fifty-four thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •