Base | Representation |
---|---|
bin | 111101100111110011… |
… | …1101111110100110111 |
3 | 110122120110121111001221 |
4 | 1323033213233310313 |
5 | 4132004033301403 |
6 | 140443112531211 |
7 | 12363214115152 |
oct | 1731747576467 |
9 | 418513544057 |
10 | 132332322103 |
11 | 51138167263 |
12 | 217919b0b07 |
13 | c62c155897 |
14 | 659514cc99 |
15 | 36979bbdbd |
hex | 1ecf9efd37 |
132332322103 has 4 divisors (see below), whose sum is σ = 132340179040. Its totient is φ = 132324465168.
The previous prime is 132332322049. The next prime is 132332322137. The reversal of 132332322103 is 301223233231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301223233231 = 661 ⋅455708371.
It is a cyclic number.
It is not a de Polignac number, because 132332322103 - 29 = 132332321591 is a prime.
It is a super-3 number, since 3×1323323221033 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132332322163) 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, 3903150 + ... + 3936907.
It is an arithmetic number, because the mean of its divisors is an integer number (33085044760).
Almost surely, 2132332322103 is an apocalyptic number.
132332322103 is a deficient number, since it is larger than the sum of its proper divisors (7856937).
132332322103 is an equidigital number, since it uses as much as digits as its factorization.
132332322103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7856936.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 132332322103 its reverse (301223233231), we get a palindrome (433555555334).
The spelling of 132332322103 in words is "one hundred thirty-two billion, three hundred thirty-two million, three hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.449 sec. • engine limits •