Base | Representation |
---|---|
bin | 10101000000101000… |
… | …01010111110000001 |
3 | 1002010002111212201200 |
4 | 22200110022332001 |
5 | 141100032430321 |
6 | 5103132251413 |
7 | 546342552012 |
oct | 124024127601 |
9 | 32102455650 |
10 | 11279576961 |
11 | 4869033134 |
12 | 2229610b69 |
13 | 10a9b245c3 |
14 | 790089009 |
15 | 4603b6d26 |
hex | 2a050af81 |
11279576961 has 6 divisors (see below), whose sum is σ = 16292722290. Its totient is φ = 7519717968.
The previous prime is 11279576933. The next prime is 11279577073. The reversal of 11279576961 is 16967597211.
11279576961 is a `hidden beast` number, since 1 + 1 + 2 + 7 + 9 + 576 + 9 + 61 = 666.
It can be written as a sum of positive squares in only one way, i.e., 8056857600 + 3222719361 = 89760^2 + 56769^2 .
It is not a de Polignac number, because 11279576961 - 25 = 11279576929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11279576898 and 11279576907.
It is not an unprimeable number, because it can be changed into a prime (11279576761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 626643156 + ... + 626643173.
It is an arithmetic number, because the mean of its divisors is an integer number (2715453715).
Almost surely, 211279576961 is an apocalyptic number.
It is an amenable number.
11279576961 is a deficient number, since it is larger than the sum of its proper divisors (5013145329).
11279576961 is a wasteful number, since it uses less digits than its factorization.
11279576961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1253286335 (or 1253286332 counting only the distinct ones).
The product of its digits is 1428840, while the sum is 54.
The spelling of 11279576961 in words is "eleven billion, two hundred seventy-nine million, five hundred seventy-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •