Base | Representation |
---|---|
bin | 11110110011001111111… |
… | …100000111000111100101 |
3 | 21111100100100221020012200 |
4 | 132303033330013013211 |
5 | 234134310303114031 |
6 | 4300205224405113 |
7 | 305630426556204 |
oct | 36631774070745 |
9 | 7440310836180 |
10 | 2116612551141 |
11 | 7467176724a0 |
12 | 2a2269316799 |
13 | 1247989cb71a |
14 | 74631d7523b |
15 | 3a0d08a98e6 |
hex | 1eccff071e5 |
2116612551141 has 24 divisors (see below), whose sum is σ = 3336170994624. Its totient is φ = 1282448280960.
The previous prime is 2116612551133. The next prime is 2116612551227. The reversal of 2116612551141 is 1411552166112.
2116612551141 is a `hidden beast` number, since 2 + 1 + 1 + 6 + 61 + 2 + 551 + 1 + 41 = 666.
It is not a de Polignac number, because 2116612551141 - 23 = 2116612551133 is a prime.
It is a super-2 number, since 2×21166125511412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2116612551096 and 2116612551105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2116612556141) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2525521 + ... + 3257526.
It is an arithmetic number, because the mean of its divisors is an integer number (139007124776).
Almost surely, 22116612551141 is an apocalyptic number.
It is an amenable number.
2116612551141 is a deficient number, since it is larger than the sum of its proper divisors (1219558443483).
2116612551141 is a wasteful number, since it uses less digits than its factorization.
2116612551141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5786761 (or 5786758 counting only the distinct ones).
The product of its digits is 14400, while the sum is 36.
The spelling of 2116612551141 in words is "two trillion, one hundred sixteen billion, six hundred twelve million, five hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •