Base | Representation |
---|---|
bin | 111101110011001011… |
… | …0010000100000011001 |
3 | 110200120001002002022111 |
4 | 1323212112100200121 |
5 | 4133244141111322 |
6 | 140545013152321 |
7 | 12405524046334 |
oct | 1734626204031 |
9 | 420501062274 |
10 | 132713613337 |
11 | 51313413a88 |
12 | 2187962b6a1 |
13 | c6901466b6 |
14 | 65cda4361b |
15 | 36bb1d7177 |
hex | 1ee6590819 |
132713613337 has 2 divisors, whose sum is σ = 132713613338. Its totient is φ = 132713613336.
The previous prime is 132713613293. The next prime is 132713613341. The reversal of 132713613337 is 733316317231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66654846976 + 66058766361 = 258176^2 + 257019^2 .
It is a cyclic number.
It is not a de Polignac number, because 132713613337 - 215 = 132713580569 is a prime.
It is a super-2 number, since 2×1327136133372 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132713613337.
It is not a weakly prime, because it can be changed into another prime (132713613937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66356806668 + 66356806669.
It is an arithmetic number, because the mean of its divisors is an integer number (66356806669).
Almost surely, 2132713613337 is an apocalyptic number.
It is an amenable number.
132713613337 is a deficient number, since it is larger than the sum of its proper divisors (1).
132713613337 is an equidigital number, since it uses as much as digits as its factorization.
132713613337 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 142884, while the sum is 40.
The spelling of 132713613337 in words is "one hundred thirty-two billion, seven hundred thirteen million, six hundred thirteen thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •