Base | Representation |
---|---|
bin | 1111101111000… |
… | …10100101100101 |
3 | 100012101022002122 |
4 | 13313202211211 |
5 | 232243000401 |
6 | 21033115325 |
7 | 3161660642 |
oct | 767424545 |
9 | 305338078 |
10 | 132000101 |
11 | 685686a2 |
12 | 38258b45 |
13 | 21468c8c |
14 | 13760dc9 |
15 | b8c621b |
hex | 7de2965 |
132000101 has 2 divisors, whose sum is σ = 132000102. Its totient is φ = 132000100.
The previous prime is 132000091. The next prime is 132000103. The reversal of 132000101 is 101000231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125104225 + 6895876 = 11185^2 + 2626^2 .
It is an emirp because it is prime and its reverse (101000231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132000101 is a prime.
It is a Sophie Germain prime.
Together with 132000103, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132000103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66000050 + 66000051.
It is an arithmetic number, because the mean of its divisors is an integer number (66000051).
Almost surely, 2132000101 is an apocalyptic number.
It is an amenable number.
132000101 is a deficient number, since it is larger than the sum of its proper divisors (1).
132000101 is an equidigital number, since it uses as much as digits as its factorization.
132000101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 132000101 is about 11489.1296885360. The cubic root of 132000101 is about 509.1644668285.
Adding to 132000101 its reverse (101000231), we get a palindrome (233000332).
The spelling of 132000101 in words is "one hundred thirty-two million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •