Base | Representation |
---|---|
bin | 1111111001000… |
… | …00101011100101 |
3 | 100021211111100122 |
4 | 13330200223211 |
5 | 233111144023 |
6 | 21121051325 |
7 | 3206025344 |
oct | 774405345 |
9 | 307744318 |
10 | 133303013 |
11 | 69278588 |
12 | 38786b45 |
13 | 2180402c |
14 | 139bdb5b |
15 | ba822c8 |
hex | 7f20ae5 |
133303013 has 8 divisors (see below), whose sum is σ = 136719576. Its totient is φ = 129894400.
The previous prime is 133302991. The next prime is 133303019. The reversal of 133303013 is 310303331.
It can be written as a sum of positive squares in 4 ways, for example, as 44528929 + 88774084 = 6673^2 + 9422^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133303013 - 210 = 133301989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133302982 and 133303000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133303019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47045 + ... + 49797.
It is an arithmetic number, because the mean of its divisors is an integer number (17089947).
Almost surely, 2133303013 is an apocalyptic number.
It is an amenable number.
133303013 is a deficient number, since it is larger than the sum of its proper divisors (3416563).
133303013 is a wasteful number, since it uses less digits than its factorization.
133303013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3975.
The product of its (nonzero) digits is 243, while the sum is 17.
The square root of 133303013 is about 11545.6924001984. The cubic root of 133303013 is about 510.8342273976.
Adding to 133303013 its reverse (310303331), we get a palindrome (443606344).
The spelling of 133303013 in words is "one hundred thirty-three million, three hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •