Base | Representation |
---|---|
bin | 110110010100001110… |
… | …0011010101010110101 |
3 | 102011002000201210211200 |
4 | 1230220130122222311 |
5 | 3402341004424101 |
6 | 125330200523113 |
7 | 11266341131163 |
oct | 1545034325265 |
9 | 364060653750 |
10 | 116642654901 |
11 | 45516813053 |
12 | 1a733480499 |
13 | accb777636 |
14 | 59074c0233 |
15 | 307a376986 |
hex | 1b2871aab5 |
116642654901 has 12 divisors (see below), whose sum is σ = 169282339200. Its totient is φ = 77393229480.
The previous prime is 116642654857. The next prime is 116642654927. The reversal of 116642654901 is 109456246611.
116642654901 is a `hidden beast` number, since 1 + 1 + 66 + 42 + 6 + 549 + 0 + 1 = 666.
It is not a de Polignac number, because 116642654901 - 211 = 116642652853 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116642654951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30709701 + ... + 30713498.
It is an arithmetic number, because the mean of its divisors is an integer number (14106861600).
Almost surely, 2116642654901 is an apocalyptic number.
It is an amenable number.
116642654901 is a deficient number, since it is larger than the sum of its proper divisors (52639684299).
116642654901 is a wasteful number, since it uses less digits than its factorization.
116642654901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61423416 (or 61423413 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The spelling of 116642654901 in words is "one hundred sixteen billion, six hundred forty-two million, six hundred fifty-four thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •