Base | Representation |
---|---|
bin | 10100111101110101… |
… | …11100111101001101 |
3 | 1002001110111122010121 |
4 | 22132322330331031 |
5 | 141023041014444 |
6 | 5100535104541 |
7 | 545640011551 |
oct | 123672747515 |
9 | 32043448117 |
10 | 11256188749 |
11 | 4856909233 |
12 | 2221812151 |
13 | 10a5025c20 |
14 | 78ad1b861 |
15 | 45d2e7084 |
hex | 29eebcf4d |
11256188749 has 8 divisors (see below), whose sum is σ = 12417709752. Its totient is φ = 10136904960.
The previous prime is 11256188717. The next prime is 11256188821. The reversal of 11256188749 is 94788165211.
It can be written as a sum of positive squares in 4 ways, for example, as 145974724 + 11110214025 = 12082^2 + 105405^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11256188749 - 25 = 11256188717 is a prime.
It is a super-2 number, since 2×112561887492 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11256188696 and 11256188705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11256188149) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10558744 + ... + 10559809.
It is an arithmetic number, because the mean of its divisors is an integer number (1552213719).
Almost surely, 211256188749 is an apocalyptic number.
It is an amenable number.
11256188749 is a deficient number, since it is larger than the sum of its proper divisors (1161521003).
11256188749 is a wasteful number, since it uses less digits than its factorization.
11256188749 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21118607.
The product of its digits is 967680, while the sum is 52.
The spelling of 11256188749 in words is "eleven billion, two hundred fifty-six million, one hundred eighty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •