Base | Representation |
---|---|
bin | 111110101010000011… |
… | …0101010110000101101 |
3 | 110212022101000020211121 |
4 | 1331110012222300231 |
5 | 4201032041122313 |
6 | 141451433020541 |
7 | 12502253542006 |
oct | 1752406526055 |
9 | 425271006747 |
10 | 134555020333 |
11 | 5207888a348 |
12 | 220b2254751 |
13 | c8c47a3836 |
14 | 67264181ad |
15 | 3777bbe28d |
hex | 1f541aac2d |
134555020333 has 2 divisors, whose sum is σ = 134555020334. Its totient is φ = 134555020332.
The previous prime is 134555020297. The next prime is 134555020343. The reversal of 134555020333 is 333020555431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133848417609 + 706602724 = 365853^2 + 26582^2 .
It is an emirp because it is prime and its reverse (333020555431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134555020333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134555020343) 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, 67277510166 + 67277510167.
It is an arithmetic number, because the mean of its divisors is an integer number (67277510167).
Almost surely, 2134555020333 is an apocalyptic number.
It is an amenable number.
134555020333 is a deficient number, since it is larger than the sum of its proper divisors (1).
134555020333 is an equidigital number, since it uses as much as digits as its factorization.
134555020333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81000, while the sum is 34.
Adding to 134555020333 its reverse (333020555431), we get a palindrome (467575575764).
The spelling of 134555020333 in words is "one hundred thirty-four billion, five hundred fifty-five million, twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •