Base | Representation |
---|---|
bin | 11110010010100111111011… |
… | …011111101111011111001101 |
3 | 122110200211020212210001211021 |
4 | 132102213323133233133031 |
5 | 114430144024311202341 |
6 | 1151200552242154141 |
7 | 40026626011135552 |
oct | 3622477337573715 |
9 | 573624225701737 |
10 | 133221220022221 |
11 | 394a28906a5951 |
12 | 12b371b9052951 |
13 | 5944926793906 |
14 | 24c7d274c0a29 |
15 | 10605ca1709d1 |
hex | 7929fb7ef7cd |
133221220022221 has 8 divisors (see below), whose sum is σ = 133554919111488. Its totient is φ = 132887528280000.
The previous prime is 133221220022171. The next prime is 133221220022237. The reversal of 133221220022221 is 122220022122331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133221220022221 - 211 = 133221220020173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133221220022321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35419026 + ... + 38999356.
It is an arithmetic number, because the mean of its divisors is an integer number (16694364888936).
Almost surely, 2133221220022221 is an apocalyptic number.
It is an amenable number.
133221220022221 is a deficient number, since it is larger than the sum of its proper divisors (333699089267).
133221220022221 is an equidigital number, since it uses as much as digits as its factorization.
133221220022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3673523.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 133221220022221 its reverse (122220022122331), we get a palindrome (255441242144552).
The spelling of 133221220022221 in words is "one hundred thirty-three trillion, two hundred twenty-one billion, two hundred twenty million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •