Base | Representation |
---|---|
bin | 111101100100110000… |
… | …1110011010010100101 |
3 | 110122022100021001220001 |
4 | 1323021201303102211 |
5 | 4131301401201013 |
6 | 140425021541301 |
7 | 12360533210005 |
oct | 1731141632245 |
9 | 418270231801 |
10 | 132230100133 |
11 | 5109549839a |
12 | 21763714831 |
13 | c613c14901 |
14 | 6585740005 |
15 | 368da28ddd |
hex | 1ec98734a5 |
132230100133 has 2 divisors, whose sum is σ = 132230100134. Its totient is φ = 132230100132.
The previous prime is 132230100127. The next prime is 132230100199. The reversal of 132230100133 is 331001032231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109556366049 + 22673734084 = 330993^2 + 150578^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132230100133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132230100133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132230100103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66115050066 + 66115050067.
It is an arithmetic number, because the mean of its divisors is an integer number (66115050067).
Almost surely, 2132230100133 is an apocalyptic number.
It is an amenable number.
132230100133 is a deficient number, since it is larger than the sum of its proper divisors (1).
132230100133 is an equidigital number, since it uses as much as digits as its factorization.
132230100133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 132230100133 its reverse (331001032231), we get a palindrome (463231132364).
The spelling of 132230100133 in words is "one hundred thirty-two billion, two hundred thirty million, one hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •