Search a number
-
+
10145231450051 is a prime number
BaseRepresentation
bin1001001110100001111011…
…1010101010111111000011
31022220212121121211022220212
42103220132322222333003
52312204413222400201
633324353251024335
72064653202323465
oct223503672527703
938825547738825
1010145231450051
113261628738aa5
12117a26959b0ab
135878ca7c5399
1427106346a135
15128d7a088abb
hex93a1eeaafc3

10145231450051 has 2 divisors, whose sum is σ = 10145231450052. Its totient is φ = 10145231450050.

The previous prime is 10145231450021. The next prime is 10145231450083. The reversal of 10145231450051 is 15005413254101.

It is an a-pointer prime, because the next prime (10145231450083) can be obtained adding 10145231450051 to its sum of digits (32).

It is a weak prime.

It is an emirp because it is prime and its reverse (15005413254101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10145231450051 - 26 = 10145231449987 is a prime.

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

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

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

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

Almost surely, 210145231450051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12000, while the sum is 32.

The spelling of 10145231450051 in words is "ten trillion, one hundred forty-five billion, two hundred thirty-one million, four hundred fifty thousand, fifty-one".