Base | Representation |
---|---|
bin | 11110011000010100000110… |
… | …010011110001000000110111 |
3 | 122112002012112222100121222112 |
4 | 132120110012103301000313 |
5 | 120003100333311043210 |
6 | 1152100341155321235 |
7 | 40100110643366000 |
oct | 3630240623610067 |
9 | 575065488317875 |
10 | 133612243456055 |
11 | 396336a8192221 |
12 | 12b9ab45bb021b |
13 | 5972771468030 |
14 | 24dcc1d40c1a7 |
15 | 106a86396ad05 |
hex | 7985064f1037 |
133612243456055 has 64 divisors (see below), whose sum is σ = 201564252422400. Its totient is φ = 84487304627712.
The previous prime is 133612243456051. The next prime is 133612243456129. The reversal of 133612243456055 is 550654342216331.
It is not a de Polignac number, because 133612243456055 - 22 = 133612243456051 is a prime.
It is a super-2 number, since 2×1336122434560552 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133612243455994 and 133612243456012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133612243456051) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 19222637 + ... + 25233593.
It is an arithmetic number, because the mean of its divisors is an integer number (3149441444100).
Almost surely, 2133612243456055 is an apocalyptic number.
133612243456055 is a deficient number, since it is larger than the sum of its proper divisors (67952008966345).
133612243456055 is an equidigital number, since it uses as much as digits as its factorization.
133612243456055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6011993 (or 6011979 counting only the distinct ones).
The product of its (nonzero) digits is 7776000, while the sum is 50.
The spelling of 133612243456055 in words is "one hundred thirty-three trillion, six hundred twelve billion, two hundred forty-three million, four hundred fifty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •