Base | Representation |
---|---|
bin | 1010010011100111110010… |
… | …0010010111110110010101 |
3 | 1111010100102102020100122122 |
4 | 2210321330202113312111 |
5 | 2441131333024042323 |
6 | 40033540303305325 |
7 | 2246503543065020 |
oct | 244717442276625 |
9 | 44110372210578 |
10 | 11332213112213 |
11 | 3679a679651a4 |
12 | 13303132ab245 |
13 | 642813c8a6b6 |
14 | 2b26a6a141b7 |
15 | 149b9bdedec8 |
hex | a4e7c897d95 |
11332213112213 has 8 divisors (see below), whose sum is σ = 13072139024832. Its totient is φ = 9622546780896.
The previous prime is 11332213112191. The next prime is 11332213112251. The reversal of 11332213112213 is 31221131223311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11332213112213 - 224 = 11332196334997 is a prime.
It is a super-2 number, since 2×113322131122132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11332213112263) 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, 7564894520 + ... + 7564896017.
It is an arithmetic number, because the mean of its divisors is an integer number (1634017378104).
Almost surely, 211332213112213 is an apocalyptic number.
It is an amenable number.
11332213112213 is a deficient number, since it is larger than the sum of its proper divisors (1739925912619).
11332213112213 is a wasteful number, since it uses less digits than its factorization.
11332213112213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15129790651.
The product of its digits is 1296, while the sum is 26.
Adding to 11332213112213 its reverse (31221131223311), we get a palindrome (42553344335524).
The spelling of 11332213112213 in words is "eleven trillion, three hundred thirty-two billion, two hundred thirteen million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •