Base | Representation |
---|---|
bin | 111101111101110011… |
… | …1000000101101001111 |
3 | 110201110220021222221002 |
4 | 1323323213000231033 |
5 | 4140012000422412 |
6 | 141044234530515 |
7 | 12420415053611 |
oct | 1737347005517 |
9 | 421426258832 |
10 | 133070326607 |
11 | 51486803a39 |
12 | 21958b96a3b |
13 | c71901043a |
14 | 662517adb1 |
15 | 36dc699dc2 |
hex | 1efb9c0b4f |
133070326607 has 8 divisors (see below), whose sum is σ = 141406654896. Its totient is φ = 124790516352.
The previous prime is 133070326603. The next prime is 133070326667. The reversal of 133070326607 is 706623070331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133070326607 - 22 = 133070326603 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133070326603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14124653 + ... + 14134070.
It is an arithmetic number, because the mean of its divisors is an integer number (17675831862).
Almost surely, 2133070326607 is an apocalyptic number.
133070326607 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
133070326607 is a deficient number, since it is larger than the sum of its proper divisors (8336328289).
133070326607 is a wasteful number, since it uses less digits than its factorization.
133070326607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28259017.
The product of its (nonzero) digits is 95256, while the sum is 38.
Adding to 133070326607 its reverse (706623070331), we get a palindrome (839693396938).
The spelling of 133070326607 in words is "one hundred thirty-three billion, seventy million, three hundred twenty-six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •