Base | Representation |
---|---|
bin | 111110001011011001… |
… | …1110010101111110101 |
3 | 110202122200222020120212 |
4 | 1330112303302233311 |
5 | 4141430311142013 |
6 | 141201415435205 |
7 | 12434625621104 |
oct | 1742663625765 |
9 | 422580866525 |
10 | 133526662133 |
11 | 516a0357637 |
12 | 21a65985b05 |
13 | c78c717a67 |
14 | 6669a0803b |
15 | 371778a6a8 |
hex | 1f16cf2bf5 |
133526662133 has 4 divisors (see below), whose sum is σ = 133630092288. Its totient is φ = 133423231980.
The previous prime is 133526662109. The next prime is 133526662151. The reversal of 133526662133 is 331266625331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 331266625331 = 334793 ⋅989467.
It is a cyclic number.
It is not a de Polignac number, because 133526662133 - 26 = 133526662069 is a prime.
It is a super-2 number, since 2×1335266621332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133526602133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51713141 + ... + 51715722.
It is an arithmetic number, because the mean of its divisors is an integer number (33407523072).
Almost surely, 2133526662133 is an apocalyptic number.
It is an amenable number.
133526662133 is a deficient number, since it is larger than the sum of its proper divisors (103430155).
133526662133 is a wasteful number, since it uses less digits than its factorization.
133526662133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103430154.
The product of its digits is 349920, while the sum is 41.
The spelling of 133526662133 in words is "one hundred thirty-three billion, five hundred twenty-six million, six hundred sixty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •