Base | Representation |
---|---|
bin | 111101101001110101… |
… | …0101100100100000101 |
3 | 110122202012100020120122 |
4 | 1323103222230210011 |
5 | 4132123423012122 |
6 | 140453535511325 |
7 | 12365000110523 |
oct | 1732352544405 |
9 | 418665306518 |
10 | 132400204037 |
11 | 51172510a32 |
12 | 217b0688545 |
13 | c6402322ca |
14 | 65a017d313 |
15 | 369d92a142 |
hex | 1ed3aac905 |
132400204037 has 2 divisors, whose sum is σ = 132400204038. Its totient is φ = 132400204036.
The previous prime is 132400204003. The next prime is 132400204043. The reversal of 132400204037 is 730402004231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124731874276 + 7668329761 = 353174^2 + 87569^2 .
It is a cyclic number.
It is not a de Polignac number, because 132400204037 - 214 = 132400187653 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132400203997 and 132400204015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132400204837) 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, 66200102018 + 66200102019.
It is an arithmetic number, because the mean of its divisors is an integer number (66200102019).
Almost surely, 2132400204037 is an apocalyptic number.
It is an amenable number.
132400204037 is a deficient number, since it is larger than the sum of its proper divisors (1).
132400204037 is an equidigital number, since it uses as much as digits as its factorization.
132400204037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 26.
Adding to 132400204037 its reverse (730402004231), we get a palindrome (862802208268).
The spelling of 132400204037 in words is "one hundred thirty-two billion, four hundred million, two hundred four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •