Base | Representation |
---|---|
bin | 1111111010000… |
… | …11110101011001 |
3 | 100022002210212112 |
4 | 13331003311121 |
5 | 233130301001 |
6 | 21124122105 |
7 | 3210165212 |
oct | 775036531 |
9 | 308083775 |
10 | 133447001 |
11 | 69366786 |
12 | 38836335 |
13 | 2185472c |
14 | 13a1a409 |
15 | baaecbb |
hex | 7f43d59 |
133447001 has 4 divisors (see below), whose sum is σ = 133682100. Its totient is φ = 133211904.
The previous prime is 133446997. The next prime is 133447007. The reversal of 133447001 is 100744331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100744331 = 151 ⋅667181.
It can be written as a sum of positive squares in 2 ways, for example, as 19811401 + 113635600 = 4451^2 + 10660^2 .
It is a cyclic number.
It is not a de Polignac number, because 133447001 - 22 = 133446997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (133447007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 116696 + ... + 117833.
It is an arithmetic number, because the mean of its divisors is an integer number (33420525).
Almost surely, 2133447001 is an apocalyptic number.
It is an amenable number.
133447001 is a deficient number, since it is larger than the sum of its proper divisors (235099).
133447001 is an equidigital number, since it uses as much as digits as its factorization.
133447001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235098.
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 133447001 is about 11551.9262895848. The cubic root of 133447001 is about 511.0180880364.
The spelling of 133447001 in words is "one hundred thirty-three million, four hundred forty-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •