Base | Representation |
---|---|
bin | 10011110011110101011… |
… | …010011111010111001111 |
3 | 11211010211012222020201002 |
4 | 103303311122133113033 |
5 | 134300444204341123 |
6 | 2521215054410515 |
7 | 200231644545401 |
oct | 23636532372717 |
9 | 4733735866632 |
10 | 1361327027663 |
11 | 485376687829 |
12 | 19ba01800a3b |
13 | 9b4ac7636a5 |
14 | 49c62396b71 |
15 | 25627e06528 |
hex | 13cf569f5cf |
1361327027663 has 2 divisors, whose sum is σ = 1361327027664. Its totient is φ = 1361327027662.
The previous prime is 1361327027587. The next prime is 1361327027699. The reversal of 1361327027663 is 3667207231631.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1361327027663 - 228 = 1361058592207 is a prime.
It is a super-2 number, since 2×13613270276632 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1361327023663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 680663513831 + 680663513832.
It is an arithmetic number, because the mean of its divisors is an integer number (680663513832).
Almost surely, 21361327027663 is an apocalyptic number.
1361327027663 is a deficient number, since it is larger than the sum of its proper divisors (1).
1361327027663 is an equidigital number, since it uses as much as digits as its factorization.
1361327027663 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 47.
The spelling of 1361327027663 in words is "one trillion, three hundred sixty-one billion, three hundred twenty-seven million, twenty-seven thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •