Base | Representation |
---|---|
bin | 1111111000000… |
… | …00100001110101 |
3 | 100021120210201000 |
4 | 13330000201311 |
5 | 233042440232 |
6 | 21114153513 |
7 | 3204636366 |
oct | 774004165 |
9 | 307523630 |
10 | 133171317 |
11 | 69198644 |
12 | 38722899 |
13 | 217890c6 |
14 | 13987b6d |
15 | ba5827c |
hex | 7f00875 |
133171317 has 8 divisors (see below), whose sum is σ = 197290880. Its totient is φ = 88780860.
The previous prime is 133171309. The next prime is 133171333. The reversal of 133171317 is 713171331.
It is a happy number.
It is not a de Polignac number, because 133171317 - 23 = 133171309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 4932271 = 133171317 / (1 + 3 + 3 + 1 + 7 + 1 + 3 + 1 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133171307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2466109 + ... + 2466162.
It is an arithmetic number, because the mean of its divisors is an integer number (24661360).
Almost surely, 2133171317 is an apocalyptic number.
It is an amenable number.
133171317 is a deficient number, since it is larger than the sum of its proper divisors (64119563).
133171317 is an equidigital number, since it uses as much as digits as its factorization.
133171317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4932280 (or 4932274 counting only the distinct ones).
The product of its digits is 1323, while the sum is 27.
The square root of 133171317 is about 11539.9877382950. The cubic root of 133171317 is about 510.6659466522.
The spelling of 133171317 in words is "one hundred thirty-three million, one hundred seventy-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •