Search a number
-
+
10368651847271 is a prime number
BaseRepresentation
bin1001011011100010001111…
…0011110110011001100111
31100201020022011201110120112
42112320203303312121213
52324334444333103041
634015143133323235
72120052600344114
oct226704363663147
940636264643515
1010368651847271
113338358726283
1211b562063651b
135a29b5007163
1427bbb9bcd90b
1512eaa46aedeb
hex96e23cf6667

10368651847271 has 2 divisors, whose sum is σ = 10368651847272. Its totient is φ = 10368651847270.

The previous prime is 10368651847207. The next prime is 10368651847289. The reversal of 10368651847271 is 17274815686301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10368651847271 - 26 = 10368651847207 is a prime.

It is a super-2 number, since 2×103686518472712 (a number of 27 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 10368651847271.

It is a congruent number.

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

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

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

Almost surely, 210368651847271 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 13547520, while the sum is 59.

The spelling of 10368651847271 in words is "ten trillion, three hundred sixty-eight billion, six hundred fifty-one million, eight hundred forty-seven thousand, two hundred seventy-one".