Base | Representation |
---|---|
bin | 10011110011111001111… |
… | …110110100100101010101 |
3 | 11211011000120011121101002 |
4 | 103303321332310211111 |
5 | 134301123314120004 |
6 | 2521230433113045 |
7 | 200233565116205 |
oct | 23637176644525 |
9 | 4734016147332 |
10 | 1361403660629 |
11 | 485405969261 |
12 | 19ba233b8785 |
13 | 9b4c25b533c |
14 | 49c6c624405 |
15 | 2562e9e261e |
hex | 13cf9fb4955 |
1361403660629 has 2 divisors, whose sum is σ = 1361403660630. Its totient is φ = 1361403660628.
The previous prime is 1361403660599. The next prime is 1361403660637. The reversal of 1361403660629 is 9260663041631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 948471471025 + 412932189604 = 973895^2 + 642598^2 .
It is a cyclic number.
It is not a de Polignac number, because 1361403660629 - 212 = 1361403656533 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1361403660679) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 680701830314 + 680701830315.
It is an arithmetic number, because the mean of its divisors is an integer number (680701830315).
Almost surely, 21361403660629 is an apocalyptic number.
It is an amenable number.
1361403660629 is a deficient number, since it is larger than the sum of its proper divisors (1).
1361403660629 is an equidigital number, since it uses as much as digits as its factorization.
1361403660629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 839808, while the sum is 47.
The spelling of 1361403660629 in words is "one trillion, three hundred sixty-one billion, four hundred three million, six hundred sixty thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •