Base | Representation |
---|---|
bin | 111101100111101111… |
… | …1010001010110111101 |
3 | 110122120022102121010122 |
4 | 1323033133101112331 |
5 | 4132003001201112 |
6 | 140442553144325 |
7 | 12363156202163 |
oct | 1731737212675 |
9 | 418508377118 |
10 | 132330100157 |
11 | 51136989942 |
12 | 217910bb0a5 |
13 | c62b858418 |
14 | 6594b31233 |
15 | 36976cd872 |
hex | 1ecf7d15bd |
132330100157 has 2 divisors, whose sum is σ = 132330100158. Its totient is φ = 132330100156.
The previous prime is 132330100121. The next prime is 132330100181. The reversal of 132330100157 is 751001033231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114359625241 + 17970474916 = 338171^2 + 134054^2 .
It is an emirp because it is prime and its reverse (751001033231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132330100157 - 28 = 132330099901 is a prime.
It is a super-2 number, since 2×1323301001572 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132330100057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66165050078 + 66165050079.
It is an arithmetic number, because the mean of its divisors is an integer number (66165050079).
Almost surely, 2132330100157 is an apocalyptic number.
It is an amenable number.
132330100157 is a deficient number, since it is larger than the sum of its proper divisors (1).
132330100157 is an equidigital number, since it uses as much as digits as its factorization.
132330100157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 26.
Adding to 132330100157 its reverse (751001033231), we get a palindrome (883331133388).
The spelling of 132330100157 in words is "one hundred thirty-two billion, three hundred thirty million, one hundred thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •