Base | Representation |
---|---|
bin | 1111110110111… |
… | …00001000011001 |
3 | 100021022020012101 |
4 | 13323130020121 |
5 | 233023202413 |
6 | 21111043401 |
7 | 3203445631 |
oct | 773341031 |
9 | 307266171 |
10 | 133022233 |
11 | 690a6633 |
12 | 38670561 |
13 | 217362a6 |
14 | 139496c1 |
15 | ba28edd |
hex | 7edc219 |
133022233 has 4 divisors (see below), whose sum is σ = 133052980. Its totient is φ = 132991488.
The previous prime is 133022203. The next prime is 133022237. The reversal of 133022233 is 332220331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 129231424 + 3790809 = 11368^2 + 1947^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133022233 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133022233.
It is not an unprimeable number, because it can be changed into a prime (133022237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7560 + ... + 17977.
It is an arithmetic number, because the mean of its divisors is an integer number (33263245).
Almost surely, 2133022233 is an apocalyptic number.
It is an amenable number.
133022233 is a deficient number, since it is larger than the sum of its proper divisors (30747).
133022233 is an equidigital number, since it uses as much as digits as its factorization.
133022233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30746.
The product of its (nonzero) digits is 648, while the sum is 19.
The square root of 133022233 is about 11533.5264771881. The cubic root of 133022233 is about 510.4753136362.
Adding to 133022233 its reverse (332220331), we get a palindrome (465242564).
The spelling of 133022233 in words is "one hundred thirty-three million, twenty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •