Base | Representation |
---|---|
bin | 1111111100100… |
… | …10101100011101 |
3 | 100022201012221221 |
4 | 13332102230131 |
5 | 233221120023 |
6 | 21135053341 |
7 | 3213012016 |
oct | 776225435 |
9 | 308635857 |
10 | 133770013 |
11 | 69567433 |
12 | 38971251 |
13 | 21938770 |
14 | 13aa200d |
15 | bb2585d |
hex | 7f92b1d |
133770013 has 8 divisors (see below), whose sum is σ = 151642400. Its totient is φ = 116980848.
The previous prime is 133769983. The next prime is 133770023. The reversal of 133770013 is 310077331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133770013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133770013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133770023) 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 7 ways as a sum of consecutive naturals, for example, 270543 + ... + 271036.
It is an arithmetic number, because the mean of its divisors is an integer number (18955300).
Almost surely, 2133770013 is an apocalyptic number.
133770013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
133770013 is a deficient number, since it is larger than the sum of its proper divisors (17872387).
133770013 is a wasteful number, since it uses less digits than its factorization.
133770013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 541611.
The product of its (nonzero) digits is 1323, while the sum is 25.
The square root of 133770013 is about 11565.8987112978. The cubic root of 133770013 is about 511.4300667516.
The spelling of 133770013 in words is "one hundred thirty-three million, seven hundred seventy thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •