Base | Representation |
---|---|
bin | 11110001111011010000110… |
… | …111000000001101110010001 |
3 | 122102220200211000110220211122 |
4 | 132033122012320001232101 |
5 | 114413033422322401001 |
6 | 1150511242503252025 |
7 | 40004643304030631 |
oct | 3617320670015621 |
9 | 572820730426748 |
10 | 133000220122001 |
11 | 39418092a4a911 |
12 | 12b0040074a015 |
13 | 5929b3689619b |
14 | 24bb3603d46c1 |
15 | 10599932bdb1b |
hex | 78f686e01b91 |
133000220122001 has 2 divisors, whose sum is σ = 133000220122002. Its totient is φ = 133000220122000.
The previous prime is 133000220121953. The next prime is 133000220122031. The reversal of 133000220122001 is 100221022000331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92516523339601 + 40483696782400 = 9618551^2 + 6362680^2 .
It is a cyclic number.
It is not a de Polignac number, because 133000220122001 - 214 = 133000220105617 is a prime.
It is not a weakly prime, because it can be changed into another prime (133000220122031) 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, 66500110061000 + 66500110061001.
It is an arithmetic number, because the mean of its divisors is an integer number (66500110061001).
Almost surely, 2133000220122001 is an apocalyptic number.
It is an amenable number.
133000220122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
133000220122001 is an equidigital number, since it uses as much as digits as its factorization.
133000220122001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 133000220122001 its reverse (100221022000331), we get a palindrome (233221242122332).
The spelling of 133000220122001 in words is "one hundred thirty-three trillion, two hundred twenty million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •