Base | Representation |
---|---|
bin | 11110011001011010101010… |
… | …011000111111100001110101 |
3 | 122112100110010022212010110022 |
4 | 132121122222120333201311 |
5 | 120010321021221434220 |
6 | 1152155231351134525 |
7 | 40105432350542102 |
oct | 3631325230774165 |
9 | 575313108763408 |
10 | 133688010733685 |
11 | 39662848902341 |
12 | 12bb1770374445 |
13 | 59799576a7ca5 |
14 | 2502769d73aa9 |
15 | 106c7ea544925 |
hex | 7996aa63f875 |
133688010733685 has 4 divisors (see below), whose sum is σ = 160425612880428. Its totient is φ = 106950408586944.
The previous prime is 133688010733591. The next prime is 133688010733691. The reversal of 133688010733685 is 586337010886331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 70821094687729 + 62866916045956 = 8415527^2 + 7928866^2 .
It is a cyclic number.
It is not a de Polignac number, because 133688010733685 - 232 = 133683715766389 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13368801073364 + ... + 13368801073373.
It is an arithmetic number, because the mean of its divisors is an integer number (40106403220107).
Almost surely, 2133688010733685 is an apocalyptic number.
It is an amenable number.
133688010733685 is a deficient number, since it is larger than the sum of its proper divisors (26737602146743).
133688010733685 is an equidigital number, since it uses as much as digits as its factorization.
133688010733685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26737602146742.
The product of its (nonzero) digits is 52254720, while the sum is 62.
The spelling of 133688010733685 in words is "one hundred thirty-three trillion, six hundred eighty-eight billion, ten million, seven hundred thirty-three thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •