Base | Representation |
---|---|
bin | 1010000111111110011101… |
… | …0001010010000011100001 |
3 | 1110102020000000000000102101 |
4 | 2201333213101102003201 |
5 | 2424342110411044413 |
6 | 35402011253250401 |
7 | 2226161546362405 |
oct | 241774721220341 |
9 | 43366000000371 |
10 | 11132140331233 |
11 | 3602129003629 |
12 | 12b9597333a01 |
13 | 6299aa867c6c |
14 | 2a6b26dc9105 |
15 | 14488c39eedd |
hex | a1fe74520e1 |
11132140331233 has 4 divisors (see below), whose sum is σ = 11132181015088. Its totient is φ = 11132099647380.
The previous prime is 11132140331197. The next prime is 11132140331287. The reversal of 11132140331233 is 33213304123111.
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 11132140331233 - 213 = 11132140323041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11132140341233) 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, 19928691 + ... + 20479672.
It is an arithmetic number, because the mean of its divisors is an integer number (2783045253772).
Almost surely, 211132140331233 is an apocalyptic number.
It is an amenable number.
11132140331233 is a deficient number, since it is larger than the sum of its proper divisors (40683855).
11132140331233 is an equidigital number, since it uses as much as digits as its factorization.
11132140331233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40683854.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 11132140331233 its reverse (33213304123111), we get a palindrome (44345444454344).
The spelling of 11132140331233 in words is "eleven trillion, one hundred thirty-two billion, one hundred forty million, three hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •