Base | Representation |
---|---|
bin | 10011101001110011001… |
… | …101100001101100001101 |
3 | 11210010000100002111020221 |
4 | 103221303031201230031 |
5 | 134111412440003103 |
6 | 2512234010311341 |
7 | 166400645112124 |
oct | 23516315415415 |
9 | 4703010074227 |
10 | 1350552656653 |
11 | 480847847382 |
12 | 1998b5428551 |
13 | 9a4834c7925 |
14 | 4951d45aabb |
15 | 251e70851bd |
hex | 13a73361b0d |
1350552656653 has 2 divisors, whose sum is σ = 1350552656654. Its totient is φ = 1350552656652.
The previous prime is 1350552656603. The next prime is 1350552656689. The reversal of 1350552656653 is 3566562550531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1335730324644 + 14822332009 = 1155738^2 + 121747^2 .
It is a cyclic number.
It is not a de Polignac number, because 1350552656653 - 225 = 1350519102221 is a prime.
It is a super-2 number, since 2×13505526566532 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1350552656653.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350552656603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675276328326 + 675276328327.
It is an arithmetic number, because the mean of its divisors is an integer number (675276328327).
Almost surely, 21350552656653 is an apocalyptic number.
It is an amenable number.
1350552656653 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350552656653 is an equidigital number, since it uses as much as digits as its factorization.
1350552656653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12150000, while the sum is 52.
The spelling of 1350552656653 in words is "one trillion, three hundred fifty billion, five hundred fifty-two million, six hundred fifty-six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •