Base | Representation |
---|---|
bin | 111110000101011010… |
… | …0100011001110010101 |
3 | 110202010200111212210111 |
4 | 1330022310203032111 |
5 | 4141022314042401 |
6 | 141125432523021 |
7 | 12426634225024 |
oct | 1741264431625 |
9 | 422120455714 |
10 | 133325534101 |
11 | 515a7874121 |
12 | 21a0a550471 |
13 | c759b571a6 |
14 | 664b0108bb |
15 | 3704cabe51 |
hex | 1f0ad23395 |
133325534101 has 4 divisors (see below), whose sum is σ = 134823573900. Its totient is φ = 131827494304.
The previous prime is 133325534099. The next prime is 133325534113. The reversal of 133325534101 is 101435523331.
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 58578520900 + 74747013201 = 242030^2 + 273399^2 .
It is a cyclic number.
It is not a de Polignac number, because 133325534101 - 21 = 133325534099 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 (133325534801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 749019766 + ... + 749019943.
It is an arithmetic number, because the mean of its divisors is an integer number (33705893475).
Almost surely, 2133325534101 is an apocalyptic number.
It is an amenable number.
133325534101 is a deficient number, since it is larger than the sum of its proper divisors (1498039799).
133325534101 is an equidigital number, since it uses as much as digits as its factorization.
133325534101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1498039798.
The product of its (nonzero) digits is 16200, while the sum is 31.
The spelling of 133325534101 in words is "one hundred thirty-three billion, three hundred twenty-five million, five hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •