Base | Representation |
---|---|
bin | 111101111111010110… |
… | …0111110100000101001 |
3 | 110201121111221120012011 |
4 | 1323332230332200221 |
5 | 4140113242101441 |
6 | 141053331115521 |
7 | 12421615134520 |
oct | 1737654764051 |
9 | 421544846164 |
10 | 133122222121 |
11 | 51503029899 |
12 | 21972442ba1 |
13 | c7269b0545 |
14 | 662c0094b7 |
15 | 36e1eeb581 |
hex | 1efeb3e829 |
133122222121 has 8 divisors (see below), whose sum is σ = 152174318400. Its totient is φ = 114078784848.
The previous prime is 133122222073. The next prime is 133122222143. The reversal of 133122222121 is 121222221331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133122222121 - 211 = 133122220073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133122222092 and 133122222101.
It is not an unprimeable number, because it can be changed into a prime (133122222221) 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 in 7 ways as a sum of consecutive naturals, for example, 2131771 + ... + 2193328.
It is an arithmetic number, because the mean of its divisors is an integer number (19021789800).
Almost surely, 2133122222121 is an apocalyptic number.
It is an amenable number.
133122222121 is a deficient number, since it is larger than the sum of its proper divisors (19052096279).
133122222121 is an equidigital number, since it uses as much as digits as its factorization.
133122222121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4329503.
The product of its digits is 576, while the sum is 22.
Adding to 133122222121 its reverse (121222221331), we get a palindrome (254344443452).
The spelling of 133122222121 in words is "one hundred thirty-three billion, one hundred twenty-two million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •