Base | Representation |
---|---|
bin | 1010000000111111110111… |
… | …1010100011001000010000 |
3 | 1102222202120102012022200102 |
4 | 2200033331322203020100 |
5 | 2420411102324213121 |
6 | 35230543554511532 |
7 | 2214416045305643 |
oct | 240177572431020 |
9 | 42882512168612 |
10 | 11012261163536 |
11 | 3566301379616 |
12 | 129a2bbb955a8 |
13 | 61b5b47095c9 |
14 | 2a0dd3b37a5a |
15 | 1416c2d1690b |
hex | a03fdea3210 |
11012261163536 has 40 divisors (see below), whose sum is σ = 22806941762304. Its totient is φ = 5138276675840.
The previous prime is 11012261163503. The next prime is 11012261163569. The reversal of 11012261163536 is 63536116221011.
It is an interprime number because it is at equal distance from previous prime (11012261163503) and next prime (11012261163569).
It is a self number, because there is not a number n which added to its sum of digits gives 11012261163536.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 364919336 + ... + 364949511.
Almost surely, 211012261163536 is an apocalyptic number.
11012261163536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11012261163536 is an abundant number, since it is smaller than the sum of its proper divisors (11794680598768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012261163536 is a wasteful number, since it uses less digits than its factorization.
11012261163536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 729868919 (or 729868913 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 38.
Adding to 11012261163536 its reverse (63536116221011), we get a palindrome (74548377384547).
The spelling of 11012261163536 in words is "eleven trillion, twelve billion, two hundred sixty-one million, one hundred sixty-three thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •