Base | Representation |
---|---|
bin | 11110001111101100101111… |
… | …001001010111111111000111 |
3 | 122102222121110001122001101011 |
4 | 132033230233021113333013 |
5 | 114413400404104023421 |
6 | 1150524351420543051 |
7 | 40006252063444300 |
oct | 3617545711277707 |
9 | 572877401561334 |
10 | 133020223111111 |
11 | 39425618130676 |
12 | 12b042636b1a87 |
13 | 592b9a3a7950b |
14 | 24bc2dac577a7 |
15 | 105a26442a4e1 |
hex | 78fb2f257fc7 |
133020223111111 has 24 divisors (see below), whose sum is σ = 162908061918000. Its totient is φ = 107999076173184.
The previous prime is 133020223111063. The next prime is 133020223111219. The reversal of 133020223111111 is 111111322020331.
It is not a de Polignac number, because 133020223111111 - 215 = 133020223078343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133020223115111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5669646 + ... + 17268043.
It is an arithmetic number, because the mean of its divisors is an integer number (6787835913250).
Almost surely, 2133020223111111 is an apocalyptic number.
133020223111111 is a deficient number, since it is larger than the sum of its proper divisors (29887838806889).
133020223111111 is a wasteful number, since it uses less digits than its factorization.
133020223111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22943951 (or 22943944 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 133020223111111 its reverse (111111322020331), we get a palindrome (244131545131442).
The spelling of 133020223111111 in words is "one hundred thirty-three trillion, twenty billion, two hundred twenty-three million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •