Base | Representation |
---|---|
bin | 1111111000011… |
… | …10111110110101 |
3 | 100021200210220121 |
4 | 13330032332311 |
5 | 233101334032 |
6 | 21115331541 |
7 | 3205304110 |
oct | 774167665 |
9 | 307623817 |
10 | 133230517 |
11 | 69229072 |
12 | 38750bb1 |
13 | 217aa034 |
14 | 139a1577 |
15 | ba6aa97 |
hex | 7f0efb5 |
133230517 has 8 divisors (see below), whose sum is σ = 152375616. Its totient is φ = 114113472.
The previous prime is 133230511. The next prime is 133230541. The reversal of 133230517 is 715032331.
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 133230517 - 27 = 133230389 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133230491 and 133230500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133230511) 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, 4413 + ... + 16909.
It is an arithmetic number, because the mean of its divisors is an integer number (19046952).
Almost surely, 2133230517 is an apocalyptic number.
It is an amenable number.
133230517 is a deficient number, since it is larger than the sum of its proper divisors (19145099).
133230517 is a wasteful number, since it uses less digits than its factorization.
133230517 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14027.
The product of its (nonzero) digits is 1890, while the sum is 25.
The square root of 133230517 is about 11542.5524473576. The cubic root of 133230517 is about 510.7416059511.
Adding to 133230517 its reverse (715032331), we get a palindrome (848262848).
The spelling of 133230517 in words is "one hundred thirty-three million, two hundred thirty thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •