Base | Representation |
---|---|
bin | 11110000010110010100011… |
… | …001001101001110110111111 |
3 | 122022211210122200220012110212 |
4 | 132002302203021221312333 |
5 | 114304332102421023403 |
6 | 1145005040244023035 |
7 | 36555205446036614 |
oct | 3602624311516677 |
9 | 568753580805425 |
10 | 132133111111103 |
11 | 39113379578a43 |
12 | 129a0347691a7b |
13 | 589613940960b |
14 | 248b3c33a450b |
15 | 10421435ca4d8 |
hex | 782ca3269dbf |
132133111111103 has 4 divisors (see below), whose sum is σ = 132525197494560. Its totient is φ = 131741024727648.
The previous prime is 132133111111009. The next prime is 132133111111151. The reversal of 132133111111103 is 301111111331231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132133111111103 - 222 = 132133106916799 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 (132133111111003) 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, 196043191223 + ... + 196043191896.
It is an arithmetic number, because the mean of its divisors is an integer number (33131299373640).
Almost surely, 2132133111111103 is an apocalyptic number.
132133111111103 is a deficient number, since it is larger than the sum of its proper divisors (392086383457).
132133111111103 is an equidigital number, since it uses as much as digits as its factorization.
132133111111103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 392086383456.
The product of its (nonzero) digits is 162, while the sum is 23.
Adding to 132133111111103 its reverse (301111111331231), we get a palindrome (433244222442334).
The spelling of 132133111111103 in words is "one hundred thirty-two trillion, one hundred thirty-three billion, one hundred eleven million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •