Base | Representation |
---|---|
bin | 110110010100100110… |
… | …1110101110001111111 |
3 | 102011002221010001021110 |
4 | 1230221031311301333 |
5 | 3402402314023012 |
6 | 125331342333103 |
7 | 11266556222115 |
oct | 1545115656177 |
9 | 364087101243 |
10 | 116655611007 |
11 | 45523062181 |
12 | 1a73788a193 |
13 | b001362880 |
14 | 59090d3ab5 |
15 | 307b58573c |
hex | 1b29375c7f |
116655611007 has 16 divisors (see below), whose sum is σ = 167581651328. Its totient is φ = 71755428960.
The previous prime is 116655611003. The next prime is 116655611063. The reversal of 116655611007 is 700116556611.
It is not a de Polignac number, because 116655611007 - 22 = 116655611003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116655611003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 592969 + ... + 764802.
It is an arithmetic number, because the mean of its divisors is an integer number (10473853208).
Almost surely, 2116655611007 is an apocalyptic number.
116655611007 is a deficient number, since it is larger than the sum of its proper divisors (50926040321).
116655611007 is a wasteful number, since it uses less digits than its factorization.
116655611007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1359990.
The product of its (nonzero) digits is 37800, while the sum is 39.
The spelling of 116655611007 in words is "one hundred sixteen billion, six hundred fifty-five million, six hundred eleven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •