Base | Representation |
---|---|
bin | 10011110010111110011… |
… | …010101011111010110101 |
3 | 11211001102220202110111112 |
4 | 103302332122223322311 |
5 | 134242102002112323 |
6 | 2520543334044405 |
7 | 200200042013243 |
oct | 23627632537265 |
9 | 4731386673445 |
10 | 1360404332213 |
11 | 484a42864003 |
12 | 19b7a47a9705 |
13 | 9b393551a54 |
14 | 49bb5a0d793 |
15 | 255c1de5178 |
hex | 13cbe6abeb5 |
1360404332213 has 2 divisors, whose sum is σ = 1360404332214. Its totient is φ = 1360404332212.
The previous prime is 1360404332201. The next prime is 1360404332317. The reversal of 1360404332213 is 3122334040631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1287948074884 + 72456257329 = 1134878^2 + 269177^2 .
It is a cyclic number.
It is not a de Polignac number, because 1360404332213 - 26 = 1360404332149 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1360404332213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1360404332813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 680202166106 + 680202166107.
It is an arithmetic number, because the mean of its divisors is an integer number (680202166107).
Almost surely, 21360404332213 is an apocalyptic number.
It is an amenable number.
1360404332213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1360404332213 is an equidigital number, since it uses as much as digits as its factorization.
1360404332213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 1360404332213 its reverse (3122334040631), we get a palindrome (4482738372844).
The spelling of 1360404332213 in words is "one trillion, three hundred sixty billion, four hundred four million, three hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •