Base | Representation |
---|---|
bin | 111101111100101001… |
… | …1000100100110000011 |
3 | 110201101012022200212101 |
4 | 1323321103010212003 |
5 | 4134422033421334 |
6 | 141040331411231 |
7 | 12416434322416 |
oct | 1737123044603 |
9 | 421335280771 |
10 | 133031545219 |
11 | 51466925a01 |
12 | 21947bb3b17 |
13 | c710c82481 |
14 | 661dd63b7d |
15 | 36d9089214 |
hex | 1ef94c4983 |
133031545219 has 2 divisors, whose sum is σ = 133031545220. Its totient is φ = 133031545218.
The previous prime is 133031545181. The next prime is 133031545243. The reversal of 133031545219 is 912545130331.
It is a strong prime.
It is an emirp because it is prime and its reverse (912545130331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133031545219 - 27 = 133031545091 is a prime.
It is a super-2 number, since 2×1330315452192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133031545319) 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, 66515772609 + 66515772610.
It is an arithmetic number, because the mean of its divisors is an integer number (66515772610).
Almost surely, 2133031545219 is an apocalyptic number.
133031545219 is a deficient number, since it is larger than the sum of its proper divisors (1).
133031545219 is an equidigital number, since it uses as much as digits as its factorization.
133031545219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 133031545219 in words is "one hundred thirty-three billion, thirty-one million, five hundred forty-five thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •