Base | Representation |
---|---|
bin | 111110010010100001… |
… | …1000001000000000000 |
3 | 110210021100110011202210 |
4 | 1330211003001000000 |
5 | 4142422434034241 |
6 | 141241231342120 |
7 | 12443556163464 |
oct | 1744503010000 |
9 | 423240404683 |
10 | 133765533696 |
11 | 5180317a353 |
12 | 21b11981940 |
13 | c7ca062092 |
14 | 668d6284a4 |
15 | 372d722316 |
hex | 1f250c1000 |
133765533696 has 104 divisors (see below), whose sum is σ = 368170902784. Its totient is φ = 43150049280.
The previous prime is 133765533689. The next prime is 133765533721. The reversal of 133765533696 is 696335567331.
It is a super-2 number, since 2×1337655336962 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205350 + ... + 556506.
Almost surely, 2133765533696 is an apocalyptic number.
133765533696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133765533696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184085451392).
133765533696 is an abundant number, since it is smaller than the sum of its proper divisors (234405369088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133765533696 is an equidigital number, since it uses as much as digits as its factorization.
133765533696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351215 (or 351193 counting only the distinct ones).
The product of its digits is 27556200, while the sum is 57.
The spelling of 133765533696 in words is "one hundred thirty-three billion, seven hundred sixty-five million, five hundred thirty-three thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •