Base | Representation |
---|---|
bin | 11110010100000101111111… |
… | …110111010100001100100011 |
3 | 122111001110222002112201022120 |
4 | 132110011333313110030203 |
5 | 114433322404102322321 |
6 | 1151315215030235323 |
7 | 40040133010503522 |
oct | 3624057767241443 |
9 | 574043862481276 |
10 | 133322225042211 |
11 | 39531702373387 |
12 | 12b528a74b5b43 |
13 | 595130257a42a |
14 | 24ccb89bd84b9 |
15 | 106303c72dec6 |
hex | 79417fdd4323 |
133322225042211 has 8 divisors (see below), whose sum is σ = 180775898362560. Its totient is φ = 87375017541672.
The previous prime is 133322225042179. The next prime is 133322225042233. The reversal of 133322225042211 is 112240522223331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133322225042211 - 25 = 133322225042179 is a prime.
It is a super-3 number, since 3×1333222250422113 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (133322225022211) 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, 376616454745 + ... + 376616455098.
It is an arithmetic number, because the mean of its divisors is an integer number (22596987295320).
Almost surely, 2133322225042211 is an apocalyptic number.
133322225042211 is a deficient number, since it is larger than the sum of its proper divisors (47453673320349).
133322225042211 is an equidigital number, since it uses as much as digits as its factorization.
133322225042211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 753232909905.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 133322225042211 its reverse (112240522223331), we get a palindrome (245562747265542).
The spelling of 133322225042211 in words is "one hundred thirty-three trillion, three hundred twenty-two billion, two hundred twenty-five million, forty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •