Base | Representation |
---|---|
bin | 1111110111011… |
… | …11100111010001 |
3 | 100021110021122221 |
4 | 13323233213101 |
5 | 233033231113 |
6 | 21112501041 |
7 | 3204230401 |
oct | 773574721 |
9 | 307407587 |
10 | 133102033 |
11 | 69150589 |
12 | 386aa781 |
13 | 217636cc |
14 | 1396a801 |
15 | ba4298d |
hex | 7eef9d1 |
133102033 has 4 divisors (see below), whose sum is σ = 133131328. Its totient is φ = 133072740.
The previous prime is 133102019. The next prime is 133102043. The reversal of 133102033 is 330201331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 133102033 - 25 = 133102001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133101998 and 133102016.
It is not an unprimeable number, because it can be changed into a prime (133102043) 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, 6213 + ... + 17458.
It is an arithmetic number, because the mean of its divisors is an integer number (33282832).
Almost surely, 2133102033 is an apocalyptic number.
It is an amenable number.
133102033 is a deficient number, since it is larger than the sum of its proper divisors (29295).
133102033 is an equidigital number, since it uses as much as digits as its factorization.
133102033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29294.
The product of its (nonzero) digits is 162, while the sum is 16.
The square root of 133102033 is about 11536.9854381463. The cubic root of 133102033 is about 510.5773712297.
Adding to 133102033 its reverse (330201331), we get a palindrome (463303364).
The spelling of 133102033 in words is "one hundred thirty-three million, one hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •