Base | Representation |
---|---|
bin | 111101101001110111… |
… | …0000111011000010111 |
3 | 110122202021000210000222 |
4 | 1323103232013120113 |
5 | 4132124140202221 |
6 | 140454011024555 |
7 | 12365010532544 |
oct | 1732356073027 |
9 | 418667023028 |
10 | 132401100311 |
11 | 51172a73357 |
12 | 217b0a3b15b |
13 | c64048724c |
14 | 65a0333bcb |
15 | 369da559ab |
hex | 1ed3b87617 |
132401100311 has 2 divisors, whose sum is σ = 132401100312. Its totient is φ = 132401100310.
The previous prime is 132401100281. The next prime is 132401100341. The reversal of 132401100311 is 113001104231.
It is a balanced prime because it is at equal distance from previous prime (132401100281) and next prime (132401100341).
It is an emirp because it is prime and its reverse (113001104231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132401100311 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132401100311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132401100341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66200550155 + 66200550156.
It is an arithmetic number, because the mean of its divisors is an integer number (66200550156).
Almost surely, 2132401100311 is an apocalyptic number.
132401100311 is a deficient number, since it is larger than the sum of its proper divisors (1).
132401100311 is an equidigital number, since it uses as much as digits as its factorization.
132401100311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132401100311 its reverse (113001104231), we get a palindrome (245402204542).
The spelling of 132401100311 in words is "one hundred thirty-two billion, four hundred one million, one hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •