Base | Representation |
---|---|
bin | 11110001111110110111110… |
… | …101100010000100010011011 |
3 | 122110000122211112201120022010 |
4 | 132033312332230100202123 |
5 | 114414040420130111443 |
6 | 1150533411023001003 |
7 | 40010121452000502 |
oct | 3617667654204233 |
9 | 573018745646263 |
10 | 133031221332123 |
11 | 3942a251363924 |
12 | 12b06412a39163 |
13 | 592ca375001ba |
14 | 24bca617c3839 |
15 | 105a6a9c67733 |
hex | 78fdbeb1089b |
133031221332123 has 8 divisors (see below), whose sum is σ = 178771615019008. Its totient is φ = 87989154266664.
The previous prime is 133031221332103. The next prime is 133031221332167. The reversal of 133031221332123 is 321233122130331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-133031221332123 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133031221332103) 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, 174581654911 + ... + 174581655672.
It is an arithmetic number, because the mean of its divisors is an integer number (22346451877376).
Almost surely, 2133031221332123 is an apocalyptic number.
133031221332123 is a deficient number, since it is larger than the sum of its proper divisors (45740393686885).
133031221332123 is a wasteful number, since it uses less digits than its factorization.
133031221332123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349163310713.
The product of its (nonzero) digits is 11664, while the sum is 30.
Adding to 133031221332123 its reverse (321233122130331), we get a palindrome (454264343462454).
The spelling of 133031221332123 in words is "one hundred thirty-three trillion, thirty-one billion, two hundred twenty-one million, three hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •