Base | Representation |
---|---|
bin | 1111110111011… |
… | …11000111100011 |
3 | 100021110011212202 |
4 | 13323233013203 |
5 | 233033200003 |
6 | 21112443415 |
7 | 3204221441 |
oct | 773570743 |
9 | 307404782 |
10 | 133100003 |
11 | 6914a003 |
12 | 386a956b |
13 | 217627ca |
14 | 13969b91 |
15 | ba42088 |
hex | 7eef1e3 |
133100003 has 4 divisors (see below), whose sum is σ = 133697088. Its totient is φ = 132502920.
The previous prime is 133099973. The next prime is 133100017. The reversal of 133100003 is 300001331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 300001331 = 7 ⋅42857333.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133100003 is a prime.
It is a super-2 number, since 2×1331000032 = 35431221597200018, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133100083) 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 3 ways as a sum of consecutive naturals, for example, 298208 + ... + 298653.
It is an arithmetic number, because the mean of its divisors is an integer number (33424272).
Almost surely, 2133100003 is an apocalyptic number.
133100003 is a deficient number, since it is larger than the sum of its proper divisors (597085).
133100003 is an equidigital number, since it uses as much as digits as its factorization.
133100003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 597084.
The product of its (nonzero) digits is 27, while the sum is 11.
The square root of 133100003 is about 11536.8974598893. The cubic root of 133100003 is about 510.5747755334.
Adding to 133100003 its reverse (300001331), we get a palindrome (433101334).
The spelling of 133100003 in words is "one hundred thirty-three million, one hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •