Base | Representation |
---|---|
bin | 111101011110001101… |
… | …0111111000011010011 |
3 | 110121202000111110122012 |
4 | 1322330122333003103 |
5 | 4130324103200431 |
6 | 140351124533135 |
7 | 12352223160266 |
oct | 1727432770323 |
9 | 417660443565 |
10 | 132010209491 |
11 | 50a9235a296 |
12 | 21701b511ab |
13 | c5aa4b4bc4 |
14 | 6564460cdd |
15 | 367959122b |
hex | 1ebc6bf0d3 |
132010209491 has 2 divisors, whose sum is σ = 132010209492. Its totient is φ = 132010209490.
The previous prime is 132010209473. The next prime is 132010209493. The reversal of 132010209491 is 194902010231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132010209491 - 230 = 130936467667 is a prime.
It is a Sophie Germain prime.
Together with 132010209493, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (132010209493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66005104745 + 66005104746.
It is an arithmetic number, because the mean of its divisors is an integer number (66005104746).
Almost surely, 2132010209491 is an apocalyptic number.
132010209491 is a deficient number, since it is larger than the sum of its proper divisors (1).
132010209491 is an equidigital number, since it uses as much as digits as its factorization.
132010209491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 32.
The spelling of 132010209491 in words is "one hundred thirty-two billion, ten million, two hundred nine thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •