Base | Representation |
---|---|
bin | 1010000110001010111100… |
… | …0110100010100101110101 |
3 | 1110022020222001122120110010 |
4 | 2201202233012202211311 |
5 | 2423340110101021323 |
6 | 35335442403250433 |
7 | 2224013300315001 |
oct | 241425706424565 |
9 | 43266861576403 |
10 | 11101133220213 |
11 | 359aa6732a143 |
12 | 12b3583079a19 |
13 | 626aa89460aa |
14 | 2a5424d01701 |
15 | 143b7513cc93 |
hex | a18af1a2975 |
11101133220213 has 8 divisors (see below), whose sum is σ = 14871660302176. Its totient is φ = 7365680809200.
The previous prime is 11101133220197. The next prime is 11101133220217. The reversal of 11101133220213 is 31202233110111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11101133220213 - 24 = 11101133220197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11101133220213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101133220217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8768666998 + ... + 8768668263.
It is an arithmetic number, because the mean of its divisors is an integer number (1858957537772).
Almost surely, 211101133220213 is an apocalyptic number.
It is an amenable number.
11101133220213 is a deficient number, since it is larger than the sum of its proper divisors (3770527081963).
11101133220213 is a wasteful number, since it uses less digits than its factorization.
11101133220213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17537335475.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11101133220213 its reverse (31202233110111), we get a palindrome (42303366330324).
The spelling of 11101133220213 in words is "eleven trillion, one hundred one billion, one hundred thirty-three million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •