Search a number
-
+
10363632945067 is a prime number
BaseRepresentation
bin1001011011001111100010…
…1010010000011110101011
31100200202100101202211001201
42112303320222100132223
52324244210013220232
634012553125025031
72116514325362143
oct226637052203653
940622311684051
1010363632945067
113336212688816
1211b465b855177
135a239528aa3c
1427b86140b923
1512e8adc72be7
hex96cf8a907ab

10363632945067 has 2 divisors, whose sum is σ = 10363632945068. Its totient is φ = 10363632945066.

The previous prime is 10363632945059. The next prime is 10363632945139. The reversal of 10363632945067 is 76054923636301.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10363632945067 - 23 = 10363632945059 is a prime.

It is a super-3 number, since 3×103636329450673 (a number of 40 digits) contains 333 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 10363632944999 and 10363632945017.

It is not a weakly prime, because it can be changed into another prime (10363632985067) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5181816472533 + 5181816472534.

It is an arithmetic number, because the mean of its divisors is an integer number (5181816472534).

Almost surely, 210363632945067 is an apocalyptic number.

10363632945067 is a deficient number, since it is larger than the sum of its proper divisors (1).

10363632945067 is an equidigital number, since it uses as much as digits as its factorization.

10363632945067 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 14696640, while the sum is 55.

The spelling of 10363632945067 in words is "ten trillion, three hundred sixty-three billion, six hundred thirty-two million, nine hundred forty-five thousand, sixty-seven".