Base | Representation |
---|---|
bin | 111110001111001101… |
… | …1010100101011100001 |
3 | 110202222121110022111121 |
4 | 1330132123110223201 |
5 | 4142211020341444 |
6 | 141222223012241 |
7 | 12441040131664 |
oct | 1743633245341 |
9 | 422877408447 |
10 | 133654465249 |
11 | 51756508a48 |
12 | 21aa073a081 |
13 | c7b00445c6 |
14 | 667c9956db |
15 | 3723ad3084 |
hex | 1f1e6d4ae1 |
133654465249 has 2 divisors, whose sum is σ = 133654465250. Its totient is φ = 133654465248.
The previous prime is 133654465207. The next prime is 133654465267. The reversal of 133654465249 is 942564456331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119411713600 + 14242751649 = 345560^2 + 119343^2 .
It is an emirp because it is prime and its reverse (942564456331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133654465249 - 219 = 133653940961 is a prime.
It is a super-2 number, since 2×1336544652492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133654465196 and 133654465205.
It is not a weakly prime, because it can be changed into another prime (133654460249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66827232624 + 66827232625.
It is an arithmetic number, because the mean of its divisors is an integer number (66827232625).
Almost surely, 2133654465249 is an apocalyptic number.
It is an amenable number.
133654465249 is a deficient number, since it is larger than the sum of its proper divisors (1).
133654465249 is an equidigital number, since it uses as much as digits as its factorization.
133654465249 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9331200, while the sum is 52.
The spelling of 133654465249 in words is "one hundred thirty-three billion, six hundred fifty-four million, four hundred sixty-five thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •