Base | Representation |
---|---|
bin | 1010001001010111101110… |
… | …0010100010000101001100 |
3 | 1110111111211222110101011010 |
4 | 2202111323202202011030 |
5 | 2430240144243432042 |
6 | 35421013130325220 |
7 | 2231000424324555 |
oct | 242257342420514 |
9 | 43444758411133 |
10 | 11156102717772 |
11 | 3611305166271 |
12 | 1302164289810 |
13 | 62c029124acc |
14 | 2a7d5b63332c |
15 | 1452e0e1159c |
hex | a257b8a214c |
11156102717772 has 48 divisors (see below), whose sum is σ = 26099894725632. Its totient is φ = 3708853513920.
The previous prime is 11156102717761. The next prime is 11156102717783. The reversal of 11156102717772 is 27771720165111.
It is an interprime number because it is at equal distance from previous prime (11156102717761) and next prime (11156102717783).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 10552197 + ... + 11561187.
It is an arithmetic number, because the mean of its divisors is an integer number (543747806784).
Almost surely, 211156102717772 is an apocalyptic number.
11156102717772 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11156102717772 is an abundant number, since it is smaller than the sum of its proper divisors (14943792007860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11156102717772 is a wasteful number, since it uses less digits than its factorization.
11156102717772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011438 (or 1011436 counting only the distinct ones).
The product of its (nonzero) digits is 288120, while the sum is 48.
The spelling of 11156102717772 in words is "eleven trillion, one hundred fifty-six billion, one hundred two million, seven hundred seventeen thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •