Base | Representation |
---|---|
bin | 1010010011100111110100… |
… | …0000100101001011010001 |
3 | 1111010100102222010200100112 |
4 | 2210321331000211023101 |
5 | 2441131342040443441 |
6 | 40033541145131105 |
7 | 2246504000306144 |
oct | 244717500451321 |
9 | 44110388120315 |
10 | 11332221031121 |
11 | 3679a71383851 |
12 | 1330315a89a95 |
13 | 642815800c43 |
14 | 2b26a7ab605b |
15 | 149b9c9654eb |
hex | a4e7d0252d1 |
11332221031121 has 8 divisors (see below), whose sum is σ = 11416007562240. Its totient is φ = 11248450001568.
The previous prime is 11332221031099. The next prime is 11332221031147. The reversal of 11332221031121 is 12113012223311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-11332221031121 is a prime.
It is a super-2 number, since 2×113322210311212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11332221037121) 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, 2405861 + ... + 5334098.
It is an arithmetic number, because the mean of its divisors is an integer number (1427000945280).
Almost surely, 211332221031121 is an apocalyptic number.
It is an amenable number.
11332221031121 is a deficient number, since it is larger than the sum of its proper divisors (83786531119).
11332221031121 is a wasteful number, since it uses less digits than its factorization.
11332221031121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7750783.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11332221031121 its reverse (12113012223311), we get a palindrome (23445233254432).
The spelling of 11332221031121 in words is "eleven trillion, three hundred thirty-two billion, two hundred twenty-one million, thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •