Base | Representation |
---|---|
bin | 1010010011110110011001… |
… | …0011111101100100100110 |
3 | 1111010201112202100012220110 |
4 | 2210331212103331210212 |
5 | 2441212401102444420 |
6 | 40035425411313450 |
7 | 2250002666234244 |
oct | 244754623754446 |
9 | 44121482305813 |
10 | 11336135203110 |
11 | 368069a876133 |
12 | 13310288ab886 |
13 | 642cba701643 |
14 | 2b2959887794 |
15 | 149d2b3d4ee0 |
hex | a4f664fd926 |
11336135203110 has 32 divisors (see below), whose sum is σ = 27349168084992. Its totient is φ = 3007142321120.
The previous prime is 11336135203093. The next prime is 11336135203123. The reversal of 11336135203110 is 1130253163311.
It is a super-2 number, since 2×113361352031102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 989185824 + ... + 989197283.
It is an arithmetic number, because the mean of its divisors is an integer number (854661502656).
Almost surely, 211336135203110 is an apocalyptic number.
11336135203110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11336135203110 is an abundant number, since it is smaller than the sum of its proper divisors (16013032881882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11336135203110 is a wasteful number, since it uses less digits than its factorization.
11336135203110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1978383308.
The product of its (nonzero) digits is 4860, while the sum is 30.
Adding to 11336135203110 its reverse (1130253163311), we get a palindrome (12466388366421).
The spelling of 11336135203110 in words is "eleven trillion, three hundred thirty-six billion, one hundred thirty-five million, two hundred three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •