Base | Representation |
---|---|
bin | 11110011001001011110111… |
… | …110011010100101111111111 |
3 | 122112021221010112201121010212 |
4 | 132121023313303110233333 |
5 | 120010041010140102144 |
6 | 1152144043435423035 |
7 | 40104330661334111 |
oct | 3631136763245777 |
9 | 575257115647125 |
10 | 133672129612799 |
11 | 39657039383148 |
12 | 12baa6798b4a7b |
13 | 59782c644573b |
14 | 2501aa0b093b1 |
15 | 106c1bb1d249e |
hex | 7992f7cd4bff |
133672129612799 has 4 divisors (see below), whose sum is σ = 133804609425120. Its totient is φ = 133539649800480.
The previous prime is 133672129612759. The next prime is 133672129612817. The reversal of 133672129612799 is 997216921276331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133672129612799 - 244 = 116079943568383 is a prime.
It is a super-2 number, since 2×1336721296127992 (a number of 29 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 (133672129612759) 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, 66239904647 + ... + 66239906664.
It is an arithmetic number, because the mean of its divisors is an integer number (33451152356280).
Almost surely, 2133672129612799 is an apocalyptic number.
133672129612799 is a deficient number, since it is larger than the sum of its proper divisors (132479812321).
133672129612799 is a wasteful number, since it uses less digits than its factorization.
133672129612799 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132479812320.
The product of its digits is 92588832, while the sum is 68.
The spelling of 133672129612799 in words is "one hundred thirty-three trillion, six hundred seventy-two billion, one hundred twenty-nine million, six hundred twelve thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •