Base | Representation |
---|---|
bin | 111101100100100001… |
… | …1010111010011110011 |
3 | 110122021210020200212010 |
4 | 1323021003113103303 |
5 | 4131242330334303 |
6 | 140424134534003 |
7 | 12360405325554 |
oct | 1731103272363 |
9 | 418253220763 |
10 | 132222121203 |
11 | 51090a38737 |
12 | 21760b07303 |
13 | c61237cc53 |
14 | 658466432b |
15 | 368ce9ec03 |
hex | 1ec90d74f3 |
132222121203 has 4 divisors (see below), whose sum is σ = 176296161608. Its totient is φ = 88148080800.
The previous prime is 132222121189. The next prime is 132222121231. The reversal of 132222121203 is 302121222231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 302121222231 = 3 ⋅100707074077.
It is a de Polignac number, because none of the positive numbers 2k-132222121203 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132222121203.
It is not an unprimeable number, because it can be changed into a prime (132222122203) 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, 22037020198 + ... + 22037020203.
It is an arithmetic number, because the mean of its divisors is an integer number (44074040402).
Almost surely, 2132222121203 is an apocalyptic number.
132222121203 is a deficient number, since it is larger than the sum of its proper divisors (44074040405).
132222121203 is an equidigital number, since it uses as much as digits as its factorization.
132222121203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44074040404.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 132222121203 its reverse (302121222231), we get a palindrome (434343343434).
The spelling of 132222121203 in words is "one hundred thirty-two billion, two hundred twenty-two million, one hundred twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •