Base | Representation |
---|---|
bin | 11110010001000000010111… |
… | …011110100101111001000001 |
3 | 122110022012020011221120101120 |
4 | 132101000113132211321001 |
5 | 114421333310201124441 |
6 | 1151033522115022453 |
7 | 40015611251313336 |
oct | 3621002736457101 |
9 | 573265204846346 |
10 | 133110020333121 |
11 | 3945a708341647 |
12 | 12b1974459aa29 |
13 | 59372b4880c00 |
14 | 24c27b8c4c98d |
15 | 105c76ca9e966 |
hex | 7910177a5e41 |
133110020333121 has 48 divisors (see below), whose sum is σ = 193601178779904. Its totient is φ = 81309280246272.
The previous prime is 133110020333099. The next prime is 133110020333153. The reversal of 133110020333121 is 121333020011331.
It is not a de Polignac number, because 133110020333121 - 210 = 133110020332097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133110020333091 and 133110020333100.
It is not an unprimeable number, because it can be changed into a prime (133110020333161) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 925608195 + ... + 925751991.
It is an arithmetic number, because the mean of its divisors is an integer number (4033357891248).
Almost surely, 2133110020333121 is an apocalyptic number.
It is an amenable number.
133110020333121 is a deficient number, since it is larger than the sum of its proper divisors (60491158446783).
133110020333121 is a wasteful number, since it uses less digits than its factorization.
133110020333121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157290 (or 157277 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 133110020333121 its reverse (121333020011331), we get a palindrome (254443040344452).
The spelling of 133110020333121 in words is "one hundred thirty-three trillion, one hundred ten billion, twenty million, three hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •