Base | Representation |
---|---|
bin | 101000011001000… |
… | …0100010101000101 |
3 | 10111110020111010021 |
4 | 1100302010111011 |
5 | 10233424132323 |
6 | 342252455141 |
7 | 45404610256 |
oct | 12062042505 |
9 | 3443214107 |
10 | 1355302213 |
11 | 63603a681 |
12 | 319a7a4b1 |
13 | 187a2b895 |
14 | cbdd8b2d |
15 | 7deb605d |
hex | 50c84545 |
1355302213 has 2 divisors, whose sum is σ = 1355302214. Its totient is φ = 1355302212.
The previous prime is 1355302187. The next prime is 1355302219. The reversal of 1355302213 is 3122035531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 784952289 + 570349924 = 28017^2 + 23882^2 .
It is an emirp because it is prime and its reverse (3122035531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1355302213 - 25 = 1355302181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1355302219) 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, 677651106 + 677651107.
It is an arithmetic number, because the mean of its divisors is an integer number (677651107).
Almost surely, 21355302213 is an apocalyptic number.
It is an amenable number.
1355302213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1355302213 is an equidigital number, since it uses as much as digits as its factorization.
1355302213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 1355302213 is about 36814.4294129354. The cubic root of 1355302213 is about 1106.6544867996.
Adding to 1355302213 its reverse (3122035531), we get a palindrome (4477337744).
The spelling of 1355302213 in words is "one billion, three hundred fifty-five million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •