Base | Representation |
---|---|
bin | 11110000000110111100010… |
… | …000110010011001000011011 |
3 | 122022101011201021012120222222 |
4 | 132000313202012103020123 |
5 | 114300201043420210021 |
6 | 1144424233301534255 |
7 | 36542521260306224 |
oct | 3600674206231033 |
9 | 568334637176888 |
10 | 132001023210011 |
11 | 3907235738491a |
12 | 1297a82371438b |
13 | 5886848ac1c67 |
14 | 2484c528bc24b |
15 | 103d9b22de6ab |
hex | 780de219321b |
132001023210011 has 2 divisors, whose sum is σ = 132001023210012. Its totient is φ = 132001023210010.
The previous prime is 132001023209903. The next prime is 132001023210013. The reversal of 132001023210011 is 110012320100231.
It is a strong prime.
It is an emirp because it is prime and its reverse (110012320100231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132001023210011 - 210 = 132001023208987 is a prime.
It is a super-2 number, since 2×1320010232100112 (a number of 29 digits) contains 22 as substring.
Together with 132001023210013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (132001023210013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66000511605005 + 66000511605006.
It is an arithmetic number, because the mean of its divisors is an integer number (66000511605006).
Almost surely, 2132001023210011 is an apocalyptic number.
132001023210011 is a deficient number, since it is larger than the sum of its proper divisors (1).
132001023210011 is an equidigital number, since it uses as much as digits as its factorization.
132001023210011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132001023210011 its reverse (110012320100231), we get a palindrome (242013343310242).
The spelling of 132001023210011 in words is "one hundred thirty-two trillion, one billion, twenty-three million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •