Base | Representation |
---|---|
bin | 11110000011111011010111… |
… | …101101000110100010111001 |
3 | 122100010021110222021121100212 |
4 | 132003323113231012202321 |
5 | 114312122221332331301 |
6 | 1145105011143040505 |
7 | 36563644214425145 |
oct | 3603732755064271 |
9 | 570107428247325 |
10 | 132211302230201 |
11 | 39143553405027 |
12 | 129b3529740135 |
13 | 58a061a861cac |
14 | 24910bdbd4225 |
15 | 10441bcd894bb |
hex | 783ed7b468b9 |
132211302230201 has 4 divisors (see below), whose sum is σ = 132215698898304. Its totient is φ = 132206905562100.
The previous prime is 132211302230191. The next prime is 132211302230251. The reversal of 132211302230201 is 102032203112231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132211302230201 - 210 = 132211302229177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132211302230251) 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, 2198288945 + ... + 2198349086.
It is an arithmetic number, because the mean of its divisors is an integer number (33053924724576).
Almost surely, 2132211302230201 is an apocalyptic number.
It is an amenable number.
132211302230201 is a deficient number, since it is larger than the sum of its proper divisors (4396668103).
132211302230201 is an equidigital number, since it uses as much as digits as its factorization.
132211302230201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4396668102.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 132211302230201 its reverse (102032203112231), we get a palindrome (234243505342432).
The spelling of 132211302230201 in words is "one hundred thirty-two trillion, two hundred eleven billion, three hundred two million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •