Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1111001000000000010101 |
3 | 1102221200202122222112121221 |
4 | 2200011210233020000111 |
5 | 2420220223414221323 |
6 | 35221500340410341 |
7 | 2213542355225404 |
oct | 240054457100025 |
9 | 42850678875557 |
10 | 11001101320213 |
11 | 35615a4996104 |
12 | 12981066a69b1 |
13 | 61a526647914 |
14 | 2a065593963b |
15 | 14126d20155d |
hex | a0164bc8015 |
11001101320213 has 4 divisors (see below), whose sum is σ = 11001434004288. Its totient is φ = 11000768636140.
The previous prime is 11001101320211. The next prime is 11001101320271. The reversal of 11001101320213 is 31202310110011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11001101320213 - 21 = 11001101320211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001101320211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 166292431 + ... + 166358572.
It is an arithmetic number, because the mean of its divisors is an integer number (2750358501072).
Almost surely, 211001101320213 is an apocalyptic number.
It is an amenable number.
11001101320213 is a deficient number, since it is larger than the sum of its proper divisors (332684075).
11001101320213 is an equidigital number, since it uses as much as digits as its factorization.
11001101320213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332684074.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11001101320213 its reverse (31202310110011), we get a palindrome (42203411430224).
The spelling of 11001101320213 in words is "eleven trillion, one billion, one hundred one million, three hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •