Search a number
-
+
101592000227 is a prime number
BaseRepresentation
bin101111010011101011…
…0101110011011100011
3100201020010021100000002
41132213112232123203
53131030023001402
6114400513050215
710224354516404
oct1364726563343
9321203240002
10101592000227
113a0a3043473
1217832b5696b
1397705a4203
144cba6719ab
152998da8602
hex17a75ae6e3

101592000227 has 2 divisors, whose sum is σ = 101592000228. Its totient is φ = 101592000226.

The previous prime is 101592000203. The next prime is 101592000233. The reversal of 101592000227 is 722000295101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101592000227 - 210 = 101591999203 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (101592009227) 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, 50796000113 + 50796000114.

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

Almost surely, 2101592000227 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 29.

Adding to 101592000227 its reverse (722000295101), we get a palindrome (823592295328).

The spelling of 101592000227 in words is "one hundred one billion, five hundred ninety-two million, two hundred twenty-seven", and thus it is an aban number.