Base | Representation |
---|---|
bin | 10011111100011011110… |
… | …011011101011111011001 |
3 | 11212000122202101210120122 |
4 | 103330123303131133121 |
5 | 134423402111324033 |
6 | 2525343235403025 |
7 | 201006531433214 |
oct | 23743363353731 |
9 | 4760582353518 |
10 | 1370561042393 |
11 | 489284a83764 |
12 | 1a175a153475 |
13 | 9c32184a42a |
14 | 4a49a8c677b |
15 | 259b890aa98 |
hex | 13f1bcdd7d9 |
1370561042393 has 2 divisors, whose sum is σ = 1370561042394. Its totient is φ = 1370561042392.
The previous prime is 1370561042303. The next prime is 1370561042441. The reversal of 1370561042393 is 3932401650731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1307702028304 + 62859014089 = 1143548^2 + 250717^2 .
It is an emirp because it is prime and its reverse (3932401650731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1370561042393 - 236 = 1301841565657 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1370561042303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 685280521196 + 685280521197.
It is an arithmetic number, because the mean of its divisors is an integer number (685280521197).
Almost surely, 21370561042393 is an apocalyptic number.
It is an amenable number.
1370561042393 is a deficient number, since it is larger than the sum of its proper divisors (1).
1370561042393 is an equidigital number, since it uses as much as digits as its factorization.
1370561042393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 44.
The spelling of 1370561042393 in words is "one trillion, three hundred seventy billion, five hundred sixty-one million, forty-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •