Base | Representation |
---|---|
bin | 10101000001011001… |
… | …01110011101000001 |
3 | 1002010112121220100200 |
4 | 22200230232131001 |
5 | 141103204420021 |
6 | 5103522235413 |
7 | 546451351131 |
oct | 124054563501 |
9 | 32115556320 |
10 | 11286013761 |
11 | 487172a200 |
12 | 222b7b5b69 |
13 | 10ab269369 |
14 | 790c82ac1 |
15 | 460c39126 |
hex | 2a0b2e741 |
11286013761 has 18 divisors (see below), whose sum is σ = 17918750850. Its totient is φ = 6840007680.
The previous prime is 11286013757. The next prime is 11286013769. The reversal of 11286013761 is 16731068211.
11286013761 is a `hidden beast` number, since 1 + 1 + 286 + 0 + 1 + 376 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 10977800625 + 308213136 = 104775^2 + 17556^2 .
It is not a de Polignac number, because 11286013761 - 22 = 11286013757 is a prime.
It is a super-2 number, since 2×112860137612 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11286013769) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 5180736 + ... + 5182913.
Almost surely, 211286013761 is an apocalyptic number.
11286013761 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11286013761 is a deficient number, since it is larger than the sum of its proper divisors (6632737089).
11286013761 is a wasteful number, since it uses less digits than its factorization.
11286013761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10363677 (or 10363663 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
It can be divided in two parts, 112860 and 13761, that added together give a palindrome (126621).
The spelling of 11286013761 in words is "eleven billion, two hundred eighty-six million, thirteen thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •