Base | Representation |
---|---|
bin | 111101111100000010… |
… | …1001010101111110111 |
3 | 110201022202220011002222 |
4 | 1323320011022233313 |
5 | 4134401321420231 |
6 | 141034321552555 |
7 | 12416065615112 |
oct | 1737005125767 |
9 | 421282804088 |
10 | 133011123191 |
11 | 514563475a1 |
12 | 219411a575b |
13 | c709981c2b |
14 | 661b369579 |
15 | 36d73a327b |
hex | 1ef814abf7 |
133011123191 has 2 divisors, whose sum is σ = 133011123192. Its totient is φ = 133011123190.
The previous prime is 133011123181. The next prime is 133011123209. The reversal of 133011123191 is 191321110331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133011123191 - 26 = 133011123127 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133011123191.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133011123101) 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, 66505561595 + 66505561596.
It is an arithmetic number, because the mean of its divisors is an integer number (66505561596).
Almost surely, 2133011123191 is an apocalyptic number.
133011123191 is a deficient number, since it is larger than the sum of its proper divisors (1).
133011123191 is an equidigital number, since it uses as much as digits as its factorization.
133011123191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 26.
The spelling of 133011123191 in words is "one hundred thirty-three billion, eleven million, one hundred twenty-three thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •