Base | Representation |
---|---|
bin | 11110000100000100011010… |
… | …111111110001010011110111 |
3 | 122100011012120022002222021121 |
4 | 132010010122333301103313 |
5 | 114312302122402211043 |
6 | 1145113255404524411 |
7 | 36564440106633655 |
oct | 3604043277612367 |
9 | 570135508088247 |
10 | 132221021132023 |
11 | 3914769048589a |
12 | 129b53a0550707 |
13 | 58a150923bc85 |
14 | 24917628a3dd5 |
15 | 104458b21dded |
hex | 78411aff14f7 |
132221021132023 has 2 divisors, whose sum is σ = 132221021132024. Its totient is φ = 132221021132022.
The previous prime is 132221021132017. The next prime is 132221021132029. The reversal of 132221021132023 is 320231120122231.
It is a balanced prime because it is at equal distance from previous prime (132221021132017) and next prime (132221021132029).
It is an emirp because it is prime and its reverse (320231120122231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132221021132023 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132221021132029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66110510566011 + 66110510566012.
It is an arithmetic number, because the mean of its divisors is an integer number (66110510566012).
Almost surely, 2132221021132023 is an apocalyptic number.
132221021132023 is a deficient number, since it is larger than the sum of its proper divisors (1).
132221021132023 is an equidigital number, since it uses as much as digits as its factorization.
132221021132023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 132221021132023 its reverse (320231120122231), we get a palindrome (452452141254254).
The spelling of 132221021132023 in words is "one hundred thirty-two trillion, two hundred twenty-one billion, twenty-one million, one hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •