Base | Representation |
---|---|
bin | 1111111001010… |
… | …10111101111111 |
3 | 100021220122011022 |
4 | 13330222331333 |
5 | 233114021101 |
6 | 21122014355 |
7 | 3206262242 |
oct | 774527577 |
9 | 307818138 |
10 | 133345151 |
11 | 692a7205 |
12 | 387a73bb |
13 | 2181a274 |
14 | 139d1259 |
15 | ba8ea1b |
hex | 7f2af7f |
133345151 has 4 divisors (see below), whose sum is σ = 136949112. Its totient is φ = 129741192.
The previous prime is 133345141. The next prime is 133345181. The reversal of 133345151 is 151543331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151543331 = 2087 ⋅72613.
It is a cyclic number.
It is not a de Polignac number, because 133345151 - 26 = 133345087 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 133345151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133345141) 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, 1801925 + ... + 1801998.
It is an arithmetic number, because the mean of its divisors is an integer number (34237278).
Almost surely, 2133345151 is an apocalyptic number.
133345151 is a deficient number, since it is larger than the sum of its proper divisors (3603961).
133345151 is an equidigital number, since it uses as much as digits as its factorization.
133345151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3603960.
The product of its digits is 2700, while the sum is 26.
The square root of 133345151 is about 11547.5170924316. The cubic root of 133345151 is about 510.8880477989. Note that the first 3 decimals are identical.
Adding to 133345151 its reverse (151543331), we get a palindrome (284888482).
The spelling of 133345151 in words is "one hundred thirty-three million, three hundred forty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •