Base | Representation |
---|---|
bin | 10101011100110111… |
… | …10001111100100001 |
3 | 1002201121020102002000 |
4 | 22232123301330201 |
5 | 142041202441031 |
6 | 5142433314213 |
7 | 555250142451 |
oct | 125633617441 |
9 | 32647212060 |
10 | 11516452641 |
11 | 497a812361 |
12 | 2294a05969 |
13 | 1116c20325 |
14 | 7b3709d61 |
15 | 4760a73e6 |
hex | 2ae6f1f21 |
11516452641 has 8 divisors (see below), whose sum is σ = 17061411360. Its totient is φ = 7677635076.
The previous prime is 11516452639. The next prime is 11516452643. The reversal of 11516452641 is 14625461511.
11516452641 is a `hidden beast` number, since 1 + 1 + 5 + 1 + 6 + 4 + 5 + 2 + 641 = 666.
It is an interprime number because it is at equal distance from previous prime (11516452639) and next prime (11516452643).
It is not a de Polignac number, because 11516452641 - 21 = 11516452639 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11516452596 and 11516452605.
It is not an unprimeable number, because it can be changed into a prime (11516452643) 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 7 ways as a sum of consecutive naturals, for example, 213267615 + ... + 213267668.
It is an arithmetic number, because the mean of its divisors is an integer number (2132676420).
Almost surely, 211516452641 is an apocalyptic number.
It is an amenable number.
11516452641 is a deficient number, since it is larger than the sum of its proper divisors (5544958719).
11516452641 is an equidigital number, since it uses as much as digits as its factorization.
11516452641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426535292 (or 426535286 counting only the distinct ones).
The product of its digits is 28800, while the sum is 36.
The spelling of 11516452641 in words is "eleven billion, five hundred sixteen million, four hundred fifty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •