Base | Representation |
---|---|
bin | 111101111101000001… |
… | …1011001100101111011 |
3 | 110201102002011100100122 |
4 | 1323322003121211323 |
5 | 4134433304323024 |
6 | 141041503123455 |
7 | 12416650106144 |
oct | 1737203314573 |
9 | 421362140318 |
10 | 133044214139 |
11 | 51472a99291 |
12 | 219502a358b |
13 | c713799a85 |
14 | 6621900acb |
15 | 36da23cd5e |
hex | 1efa0d997b |
133044214139 has 2 divisors, whose sum is σ = 133044214140. Its totient is φ = 133044214138.
The previous prime is 133044214117. The next prime is 133044214157. The reversal of 133044214139 is 931412440331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133044214139 - 216 = 133044148603 is a prime.
It is a super-2 number, since 2×1330442141392 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133044214099 and 133044214108.
It is not a weakly prime, because it can be changed into another prime (133044214339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66522107069 + 66522107070.
It is an arithmetic number, because the mean of its divisors is an integer number (66522107070).
Almost surely, 2133044214139 is an apocalyptic number.
133044214139 is a deficient number, since it is larger than the sum of its proper divisors (1).
133044214139 is an equidigital number, since it uses as much as digits as its factorization.
133044214139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 35.
The spelling of 133044214139 in words is "one hundred thirty-three billion, forty-four million, two hundred fourteen thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •