Base | Representation |
---|---|
bin | 1111111010000… |
… | …01101011001001 |
3 | 100022002100201211 |
4 | 13331001223021 |
5 | 233130010103 |
6 | 21124013121 |
7 | 3210130342 |
oct | 775015311 |
9 | 308070654 |
10 | 133438153 |
11 | 69360072 |
12 | 388311a1 |
13 | 218506b4 |
14 | 13a170c9 |
15 | baac36d |
hex | 7f41ac9 |
133438153 has 4 divisors (see below), whose sum is σ = 135955908. Its totient is φ = 130920400.
The previous prime is 133438141. The next prime is 133438163. The reversal of 133438153 is 351834331.
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 119836809 + 13601344 = 10947^2 + 3688^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133438153 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133438103) 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, 1258798 + ... + 1258903.
It is an arithmetic number, because the mean of its divisors is an integer number (33988977).
Almost surely, 2133438153 is an apocalyptic number.
It is an amenable number.
133438153 is a deficient number, since it is larger than the sum of its proper divisors (2517755).
133438153 is an equidigital number, since it uses as much as digits as its factorization.
133438153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2517754.
The product of its digits is 12960, while the sum is 31.
The square root of 133438153 is about 11551.5433168040. The cubic root of 133438153 is about 511.0067936949.
The spelling of 133438153 in words is "one hundred thirty-three million, four hundred thirty-eight thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •