Base | Representation |
---|---|
bin | 111101100110111000… |
… | …1110101001010111001 |
3 | 110122111022110001000022 |
4 | 1323031301311022321 |
5 | 4131423130123001 |
6 | 140440050220225 |
7 | 12362360303264 |
oct | 1731561651271 |
9 | 418438401008 |
10 | 132301411001 |
11 | 511217742a1 |
12 | 21783584675 |
13 | c625921ca6 |
14 | 6590dc3cdb |
15 | 3694e1311b |
hex | 1ecdc752b9 |
132301411001 has 4 divisors (see below), whose sum is σ = 132302190372. Its totient is φ = 132300631632.
The previous prime is 132301410979. The next prime is 132301411013. The reversal of 132301411001 is 100114103231.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 87494682025 + 44806728976 = 295795^2 + 211676^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132301411001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132301411091) 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, 14906 + ... + 514611.
It is an arithmetic number, because the mean of its divisors is an integer number (33075547593).
Almost surely, 2132301411001 is an apocalyptic number.
It is an amenable number.
132301411001 is a deficient number, since it is larger than the sum of its proper divisors (779371).
132301411001 is an equidigital number, since it uses as much as digits as its factorization.
132301411001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 779370.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132301411001 its reverse (100114103231), we get a palindrome (232415514232).
The spelling of 132301411001 in words is "one hundred thirty-two billion, three hundred one million, four hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •