Search a number
-
+
9145811163011 is a prime number
BaseRepresentation
bin1000010100010110110011…
…0100110101011110000011
31012101022221022020101010012
42011011230310311132003
52144321110124204021
631241305545455135
71632522504130625
oct205055464653603
935338838211105
109145811163011
112a06797a75026
1210386297a14ab
135145a5671483
14238934008c15
1510cd8468435b
hex8516cd35783

9145811163011 has 2 divisors, whose sum is σ = 9145811163012. Its totient is φ = 9145811163010.

The previous prime is 9145811162953. The next prime is 9145811163061. The reversal of 9145811163011 is 1103611185419.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 9145811163011 - 26 = 9145811162947 is a prime.

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

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

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

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

Almost surely, 29145811163011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25920, while the sum is 41.

The spelling of 9145811163011 in words is "nine trillion, one hundred forty-five billion, eight hundred eleven million, one hundred sixty-three thousand, eleven".