Base | Representation |
---|---|
bin | 111101100001010001… |
… | …1100010000011010111 |
3 | 110122000012010112010111 |
4 | 1323002203202003113 |
5 | 4131031424111203 |
6 | 140405242303451 |
7 | 12354612635353 |
oct | 1730243420327 |
9 | 418005115114 |
10 | 132113113303 |
11 | 51035454466 |
12 | 217304b7b87 |
13 | c5c5904332 |
14 | 6573daa463 |
15 | 368361b26d |
hex | 1ec28e20d7 |
132113113303 has 4 divisors (see below), whose sum is σ = 134605813608. Its totient is φ = 129620413000.
The previous prime is 132113113291. The next prime is 132113113333. The reversal of 132113113303 is 303311311231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303311311231 = 7621 ⋅39799411.
It is a cyclic number.
It is not a de Polignac number, because 132113113303 - 221 = 132111016151 is a prime.
It is a super-2 number, since 2×1321131133032 (a number of 23 digits) contains 22 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 (132113113333) 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, 1246350073 + ... + 1246350178.
It is an arithmetic number, because the mean of its divisors is an integer number (33651453402).
Almost surely, 2132113113303 is an apocalyptic number.
132113113303 is a deficient number, since it is larger than the sum of its proper divisors (2492700305).
132113113303 is an equidigital number, since it uses as much as digits as its factorization.
132113113303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2492700304.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 132113113303 its reverse (303311311231), we get a palindrome (435424424534).
The spelling of 132113113303 in words is "one hundred thirty-two billion, one hundred thirteen million, one hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •