Base | Representation |
---|---|
bin | 11110010010010100010000… |
… | …101101001001011000101111 |
3 | 122110121210202001122122210102 |
4 | 132102110100231021120233 |
5 | 114424322301330134411 |
6 | 1151143140500501315 |
7 | 40025250450450236 |
oct | 3622242055113057 |
9 | 573553661578712 |
10 | 133200101021231 |
11 | 39494933563922 |
12 | 12b330a43aa83b |
13 | 594293c31481a |
14 | 24c6cc2751b1d |
15 | 105ec91068d3b |
hex | 792510b4962f |
133200101021231 has 2 divisors, whose sum is σ = 133200101021232. Its totient is φ = 133200101021230.
The previous prime is 133200101021189. The next prime is 133200101021233. The reversal of 133200101021231 is 132120101002331.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133200101021231 - 214 = 133200101004847 is a prime.
It is a super-2 number, since 2×1332001010212312 (a number of 29 digits) contains 22 as substring.
Together with 133200101021233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133200101021233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66600050510615 + 66600050510616.
It is an arithmetic number, because the mean of its divisors is an integer number (66600050510616).
Almost surely, 2133200101021231 is an apocalyptic number.
133200101021231 is a deficient number, since it is larger than the sum of its proper divisors (1).
133200101021231 is an equidigital number, since it uses as much as digits as its factorization.
133200101021231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 133200101021231 its reverse (132120101002331), we get a palindrome (265320202023562).
The spelling of 133200101021231 in words is "one hundred thirty-three trillion, two hundred billion, one hundred one million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •