Base | Representation |
---|---|
bin | 1111111101101… |
… | …01011001010111 |
3 | 100022222102221022 |
4 | 13332311121113 |
5 | 233240142101 |
6 | 21142111355 |
7 | 3214143302 |
oct | 776653127 |
9 | 308872838 |
10 | 133912151 |
11 | 696541aa |
12 | 38a1b55b |
13 | 21988379 |
14 | 13adbb39 |
15 | bb52a1b |
hex | 7fb5657 |
133912151 has 2 divisors, whose sum is σ = 133912152. Its totient is φ = 133912150.
The previous prime is 133912127. The next prime is 133912153. The reversal of 133912151 is 151219331.
It is a strong prime.
It is an emirp because it is prime and its reverse (151219331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133912151 - 214 = 133895767 is a prime.
Together with 133912153, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133912151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133912153) 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 as a sum of consecutive naturals, namely, 66956075 + 66956076.
It is an arithmetic number, because the mean of its divisors is an integer number (66956076).
Almost surely, 2133912151 is an apocalyptic number.
133912151 is a deficient number, since it is larger than the sum of its proper divisors (1).
133912151 is an equidigital number, since it uses as much as digits as its factorization.
133912151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 810, while the sum is 26.
The square root of 133912151 is about 11572.0417818119. The cubic root of 133912151 is about 511.6111434952.
The spelling of 133912151 in words is "one hundred thirty-three million, nine hundred twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •