Base | Representation |
---|---|
bin | 10110000101111111… |
… | …10101101000100000 |
3 | 1010121122102001110010 |
4 | 23002333311220200 |
5 | 143243012333443 |
6 | 5241000004520 |
7 | 566636440455 |
oct | 130277655040 |
9 | 33548361403 |
10 | 11861449248 |
11 | 503752a420 |
12 | 2370460740 |
13 | 117054402c |
14 | 80747382c |
15 | 496503733 |
hex | 2c2ff5a20 |
11861449248 has 48 divisors (see below), whose sum is σ = 33966880416. Its totient is φ = 3594378240.
The previous prime is 11861449231. The next prime is 11861449273. The reversal of 11861449248 is 84294416811.
11861449248 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 11861449197 and 11861449206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5615161 + ... + 5617272.
It is an arithmetic number, because the mean of its divisors is an integer number (707643342).
Almost surely, 211861449248 is an apocalyptic number.
It is an amenable number.
11861449248 is an abundant number, since it is smaller than the sum of its proper divisors (22105431168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11861449248 is a wasteful number, since it uses less digits than its factorization.
11861449248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11232457 (or 11232449 counting only the distinct ones).
The product of its digits is 442368, while the sum is 48.
The spelling of 11861449248 in words is "eleven billion, eight hundred sixty-one million, four hundred forty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •