Search a number
-
+
10140432009007 is a prime number
BaseRepresentation
bin1001001110010000000011…
…0110010000011100101111
31022220102020010211110112011
42103210000312100130233
52312120101043242012
633322241122222051
72064423233622136
oct223440066203457
938812203743464
1010140432009007
11325a5955659a3
12117934a1b4927
13587314388341
14270b29c9491d
15128b98a4c1a7
hex93900d9072f

10140432009007 has 2 divisors, whose sum is σ = 10140432009008. Its totient is φ = 10140432009006.

The previous prime is 10140432008999. The next prime is 10140432009013. The reversal of 10140432009007 is 70090023404101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10140432009007 - 23 = 10140432008999 is a prime.

It is a super-2 number, since 2×101404320090072 (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 10140432009007.

It is a congruent number.

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

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

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

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

Almost surely, 210140432009007 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6048, while the sum is 31.

The spelling of 10140432009007 in words is "ten trillion, one hundred forty billion, four hundred thirty-two million, nine thousand, seven".