Base | Representation |
---|---|
bin | 11110000010010110110100… |
… | …110111000000010110101011 |
3 | 122022201221211010202220020201 |
4 | 132002112310313000112223 |
5 | 114303340121410110243 |
6 | 1144543234351333031 |
7 | 36553103000030422 |
oct | 3602266467002653 |
9 | 568657733686221 |
10 | 132103343441323 |
11 | 3910179349a061 |
12 | 1299661a521177 |
13 | 58933a420b327 |
14 | 2489b9bb562b9 |
15 | 10414a009504d |
hex | 7825b4dc05ab |
132103343441323 has 2 divisors, whose sum is σ = 132103343441324. Its totient is φ = 132103343441322.
The previous prime is 132103343441281. The next prime is 132103343441357. The reversal of 132103343441323 is 323144343301231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132103343441323 is a prime.
It is a super-2 number, since 2×1321033434413232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (132103343441623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66051671720661 + 66051671720662.
It is an arithmetic number, because the mean of its divisors is an integer number (66051671720662).
Almost surely, 2132103343441323 is an apocalyptic number.
132103343441323 is a deficient number, since it is larger than the sum of its proper divisors (1).
132103343441323 is an equidigital number, since it uses as much as digits as its factorization.
132103343441323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 37.
Adding to 132103343441323 its reverse (323144343301231), we get a palindrome (455247686742554).
The spelling of 132103343441323 in words is "one hundred thirty-two trillion, one hundred three billion, three hundred forty-three million, four hundred forty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •