Base | Representation |
---|---|
bin | 111110001011010000… |
… | …0000111000111111001 |
3 | 110202122100021010012020 |
4 | 1330112200013013321 |
5 | 4141423001041323 |
6 | 141201113105053 |
7 | 12434534022054 |
oct | 1742640070771 |
9 | 422570233166 |
10 | 133521502713 |
11 | 51698453255 |
12 | 21a640b8189 |
13 | c78b62c551 |
14 | 6669063a9b |
15 | 37170bbae3 |
hex | 1f168071f9 |
133521502713 has 8 divisors (see below), whose sum is σ = 180467419488. Its totient is φ = 87794960544.
The previous prime is 133521502711. The next prime is 133521502717. The reversal of 133521502713 is 317205125331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133521502713 - 21 = 133521502711 is a prime.
It is not an unprimeable number, because it can be changed into a prime (133521502711) 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 7 ways as a sum of consecutive naturals, for example, 304843395 + ... + 304843832.
It is an arithmetic number, because the mean of its divisors is an integer number (22558427436).
Almost surely, 2133521502713 is an apocalyptic number.
It is an amenable number.
133521502713 is a deficient number, since it is larger than the sum of its proper divisors (46945916775).
133521502713 is an equidigital number, since it uses as much as digits as its factorization.
133521502713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609687303.
The product of its (nonzero) digits is 18900, while the sum is 33.
The spelling of 133521502713 in words is "one hundred thirty-three billion, five hundred twenty-one million, five hundred two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •