Base | Representation |
---|---|
bin | 111101100111100000… |
… | …0011010110010001111 |
3 | 110122112202012200200111 |
4 | 1323033000122302033 |
5 | 4131443413343203 |
6 | 140442103540451 |
7 | 12363030355345 |
oct | 1731700326217 |
9 | 418482180614 |
10 | 132322012303 |
11 | 51132365368 |
12 | 2178a45a727 |
13 | c629c86000 |
14 | 6593a27995 |
15 | 3696b3226d |
hex | 1ecf01ac8f |
132322012303 has 16 divisors (see below), whose sum is σ = 150888287200. Its totient is φ = 115714759680.
The previous prime is 132322012183. The next prime is 132322012309. The reversal of 132322012303 is 303210223231.
It is not a de Polignac number, because 132322012303 - 225 = 132288457871 is a prime.
It is a super-3 number, since 3×1323220123033 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132322012309) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1543218 + ... + 1626703.
It is an arithmetic number, because the mean of its divisors is an integer number (9430517950).
Almost surely, 2132322012303 is an apocalyptic number.
132322012303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132322012303 is a deficient number, since it is larger than the sum of its proper divisors (18566274897).
132322012303 is an equidigital number, since it uses as much as digits as its factorization.
132322012303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3169979 (or 3169953 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 132322012303 its reverse (303210223231), we get a palindrome (435532235534).
The spelling of 132322012303 in words is "one hundred thirty-two billion, three hundred twenty-two million, twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •