Base | Representation |
---|---|
bin | 1111110000000… |
… | …00001001110001 |
3 | 100012121110012211 |
4 | 13320000021301 |
5 | 232310334301 |
6 | 21035452121 |
7 | 3163004002 |
oct | 770001161 |
9 | 305543184 |
10 | 132121201 |
11 | 68640683 |
12 | 382b7041 |
13 | 214ac134 |
14 | 137931a9 |
15 | b8ec051 |
hex | 7e00271 |
132121201 has 2 divisors, whose sum is σ = 132121202. Its totient is φ = 132121200.
The previous prime is 132121169. The next prime is 132121207. The reversal of 132121201 is 102121231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100480576 + 31640625 = 10024^2 + 5625^2 .
It is an emirp because it is prime and its reverse (102121231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132121201 - 25 = 132121169 is a prime.
It is not a weakly prime, because it can be changed into another prime (132121207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66060600 + 66060601.
It is an arithmetic number, because the mean of its divisors is an integer number (66060601).
Almost surely, 2132121201 is an apocalyptic number.
It is an amenable number.
132121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
132121201 is an equidigital number, since it uses as much as digits as its factorization.
132121201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 132121201 is about 11494.3986793568. The cubic root of 132121201 is about 509.3201257258.
Adding to 132121201 its reverse (102121231), we get a palindrome (234242432).
It can be divided in two parts, 1321 and 21201, that added together give a palindrome (22522).
The spelling of 132121201 in words is "one hundred thirty-two million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •