Base | Representation |
---|---|
bin | 1010010011100011101011… |
… | …0011001101110000111101 |
3 | 1111010020120112222012012001 |
4 | 2210320322303031300331 |
5 | 2441122103204343401 |
6 | 40033235024542301 |
7 | 2246434321542133 |
oct | 244707263156075 |
9 | 44106515865161 |
10 | 11331110231101 |
11 | 3679551362301 |
12 | 1330065a81991 |
13 | 64269963b51b |
14 | 2b2600365753 |
15 | 149b35199601 |
hex | a4e3accdc3d |
11331110231101 has 4 divisors (see below), whose sum is σ = 11378520734400. Its totient is φ = 11283699727804.
The previous prime is 11331110231071. The next prime is 11331110231107. The reversal of 11331110231101 is 10113201113311.
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 11331110231101 - 25 = 11331110231069 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 (11331110231107) 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, 23705251291 + ... + 23705251768.
It is an arithmetic number, because the mean of its divisors is an integer number (2844630183600).
Almost surely, 211331110231101 is an apocalyptic number.
It is an amenable number.
11331110231101 is a deficient number, since it is larger than the sum of its proper divisors (47410503299).
11331110231101 is an equidigital number, since it uses as much as digits as its factorization.
11331110231101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47410503298.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 11331110231101 its reverse (10113201113311), we get a palindrome (21444311344412).
The spelling of 11331110231101 in words is "eleven trillion, three hundred thirty-one billion, one hundred ten million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •