Base | Representation |
---|---|
bin | 10000001010000… |
… | …00011101011101 |
3 | 100110000122122222 |
4 | 20011000131131 |
5 | 234143432313 |
6 | 21240515125 |
7 | 3233663111 |
oct | 1005003535 |
9 | 313018588 |
10 | 135530333 |
11 | 6a559a44 |
12 | 3947baa5 |
13 | 22103a83 |
14 | 13ddd741 |
15 | bd72208 |
hex | 814075d |
135530333 has 2 divisors, whose sum is σ = 135530334. Its totient is φ = 135530332.
The previous prime is 135530321. The next prime is 135530377. The reversal of 135530333 is 333035531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111978724 + 23551609 = 10582^2 + 4853^2 .
It is an emirp because it is prime and its reverse (333035531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135530333 - 28 = 135530077 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135530303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67765166 + 67765167.
It is an arithmetic number, because the mean of its divisors is an integer number (67765167).
Almost surely, 2135530333 is an apocalyptic number.
It is an amenable number.
135530333 is a deficient number, since it is larger than the sum of its proper divisors (1).
135530333 is an equidigital number, since it uses as much as digits as its factorization.
135530333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6075, while the sum is 26.
The square root of 135530333 is about 11641.7495678270. The cubic root of 135530333 is about 513.6636519750.
Adding to 135530333 its reverse (333035531), we get a palindrome (468565864).
The spelling of 135530333 in words is "one hundred thirty-five million, five hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •