Base | Representation |
---|---|
bin | 101000010101000… |
… | …0100100101100101 |
3 | 10111022021222211002 |
4 | 1100222010211211 |
5 | 10232410043432 |
6 | 342135523045 |
7 | 45351030224 |
oct | 12052044545 |
9 | 3438258732 |
10 | 1353206117 |
11 | 63493886a |
12 | 319229485 |
13 | 1874767a3 |
14 | cba10cbb |
15 | 7dbeee62 |
hex | 50a84965 |
1353206117 has 2 divisors, whose sum is σ = 1353206118. Its totient is φ = 1353206116.
The previous prime is 1353206077. The next prime is 1353206161. The reversal of 1353206117 is 7116023531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 987593476 + 365612641 = 31426^2 + 19121^2 .
It is an emirp because it is prime and its reverse (7116023531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1353206117 - 26 = 1353206053 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1353206117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1353206417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 676603058 + 676603059.
It is an arithmetic number, because the mean of its divisors is an integer number (676603059).
Almost surely, 21353206117 is an apocalyptic number.
It is an amenable number.
1353206117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1353206117 is an equidigital number, since it uses as much as digits as its factorization.
1353206117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3780, while the sum is 29.
The square root of 1353206117 is about 36785.9499945292. The cubic root of 1353206117 is about 1106.0836790737.
Adding to 1353206117 its reverse (7116023531), we get a palindrome (8469229648).
The spelling of 1353206117 in words is "one billion, three hundred fifty-three million, two hundred six thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •