Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0101101111100011001110 |
3 | 1102222122100012220200111000 |
4 | 2200032303111233203032 |
5 | 2420401022030013402 |
6 | 35230215502041130 |
7 | 2214343043512026 |
oct | 240166325574316 |
9 | 42878305820430 |
10 | 11011010001102 |
11 | 356581a0a8781 |
12 | 129a010b791a6 |
13 | 61b4454408c7 |
14 | 2a0d158caa86 |
15 | 14164d071c1c |
hex | a03b356f8ce |
11011010001102 has 144 divisors (see below), whose sum is σ = 25430040221040. Its totient is φ = 3531470564160.
The previous prime is 11011010001071. The next prime is 11011010001109. The reversal of 11011010001102 is 20110001011011.
It is a super-4 number, since 4×110110100011024 (a number of 53 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011010001109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 4975602148 + ... + 4975604360.
It is an arithmetic number, because the mean of its divisors is an integer number (176597501535).
Almost surely, 211011010001102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11011010001102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12715020110520).
11011010001102 is an abundant number, since it is smaller than the sum of its proper divisors (14419030219938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011010001102 is an equidigital number, since it uses as much as digits as its factorization.
11011010001102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2944 (or 2578 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011010001102 its reverse (20110001011011), we get a palindrome (31121011012113).
The spelling of 11011010001102 in words is "eleven trillion, eleven billion, ten million, one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •