Base | Representation |
---|---|
bin | 10100011111111011… |
… | …10001001101100100 |
3 | 1001101222100120201111 |
4 | 22033331301031210 |
5 | 140014322100321 |
6 | 5020013034404 |
7 | 536502145612 |
oct | 121775611544 |
9 | 31358316644 |
10 | 11005268836 |
11 | 4738207401 |
12 | 2171785a04 |
13 | 10650508c3 |
14 | 7658826b2 |
15 | 4462805e1 |
hex | 28ff71364 |
11005268836 has 9 divisors (see below), whose sum is σ = 19259587641. Its totient is φ = 5502529512.
The previous prime is 11005268819. The next prime is 11005268837. The reversal of 11005268836 is 63886250011.
The square root of 11005268836 is 104906.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 4420920100 + 6584348736 = 66490^2 + 81144^2 .
It is a super-2 number, since 2×110052688362 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11005268837) 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 2 ways as a sum of consecutive naturals, for example, 183586 + ... + 236038.
Almost surely, 211005268836 is an apocalyptic number.
11005268836 is the 104906-th square number.
It is an amenable number.
11005268836 is a deficient number, since it is larger than the sum of its proper divisors (8254318805).
11005268836 is an frugal number, since it uses more digits than its factorization.
11005268836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104910 (or 52455 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 40.
It can be divided in two parts, 11005 and 268836, that added together give a 4-th power (279841 = 234).
The spelling of 11005268836 in words is "eleven billion, five million, two hundred sixty-eight thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •