Base | Representation |
---|---|
bin | 11110010001000011011011… |
… | …001110001000000101001111 |
3 | 122110022111201001101222002102 |
4 | 132101003123032020011033 |
5 | 114421412021403213210 |
6 | 1151035224030545315 |
7 | 40016055526102550 |
oct | 3621033316100517 |
9 | 573274631358072 |
10 | 133113304351055 |
11 | 3946104305a956 |
12 | 12b1a30036823b |
13 | 59376b90588a2 |
14 | 24c2a0b068327 |
15 | 105c8b1046ea5 |
hex | 7910db38814f |
133113304351055 has 24 divisors (see below), whose sum is σ = 190837674922272. Its totient is φ = 87309098990784.
The previous prime is 133113304351051. The next prime is 133113304351067. The reversal of 133113304351055 is 550153403311331.
It is not a de Polignac number, because 133113304351055 - 22 = 133113304351051 is a prime.
It is a super-2 number, since 2×1331133043510552 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133113304351051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3594723704 + ... + 3594760733.
It is an arithmetic number, because the mean of its divisors is an integer number (7951569788428).
Almost surely, 2133113304351055 is an apocalyptic number.
133113304351055 is a deficient number, since it is larger than the sum of its proper divisors (57724370571217).
133113304351055 is an equidigital number, since it uses as much as digits as its factorization.
133113304351055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7189484495 (or 7189484472 counting only the distinct ones).
The product of its (nonzero) digits is 121500, while the sum is 38.
Adding to 133113304351055 its reverse (550153403311331), we get a palindrome (683266707662386).
The spelling of 133113304351055 in words is "one hundred thirty-three trillion, one hundred thirteen billion, three hundred four million, three hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •