Base | Representation |
---|---|
bin | 1010010011100111000111… |
… | …0000101111100101110101 |
3 | 1111010022221211001200012212 |
4 | 2210321301300233211311 |
5 | 2441131000234030401 |
6 | 40033510324423205 |
7 | 2246466216341330 |
oct | 244716160574565 |
9 | 44108854050185 |
10 | 11332032330101 |
11 | 367998490899a |
12 | 1330282847b05 |
13 | 6427b56a1832 |
14 | 2b268a9d5617 |
15 | 149b8b0dddbb |
hex | a4e71c2f975 |
11332032330101 has 4 divisors (see below), whose sum is σ = 12950894091552. Its totient is φ = 9713170568652.
The previous prime is 11332032330079. The next prime is 11332032330127. The reversal of 11332032330101 is 10103323023311.
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 a de Polignac number, because none of the positive numbers 2k-11332032330101 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 (11332032300101) 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, 809430880715 + ... + 809430880728.
It is an arithmetic number, because the mean of its divisors is an integer number (3237723522888).
Almost surely, 211332032330101 is an apocalyptic number.
It is an amenable number.
11332032330101 is a deficient number, since it is larger than the sum of its proper divisors (1618861761451).
11332032330101 is an equidigital number, since it uses as much as digits as its factorization.
11332032330101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1618861761450.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 11332032330101 its reverse (10103323023311), we get a palindrome (21435355353412).
The spelling of 11332032330101 in words is "eleven trillion, three hundred thirty-two billion, thirty-two million, three hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •