Search a number
-
+
119015227 is a prime number
BaseRepresentation
bin1110001100000…
…00011100111011
322021221121012101
413012000130323
5220431441402
615450524231
72643420112
oct706003473
9267847171
10119015227
11611a99a1
1233a36677
131b870916
1411b40c79
15a6adb87
hex718073b

119015227 has 2 divisors, whose sum is σ = 119015228. Its totient is φ = 119015226.

The previous prime is 119015219. The next prime is 119015279. The reversal of 119015227 is 722510911.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 119015227 - 23 = 119015219 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 119015195 and 119015204.

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

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

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

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

Almost surely, 2119015227 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1260, while the sum is 28.

The square root of 119015227 is about 10909.4100207115. The cubic root of 119015227 is about 491.8894520504.

The spelling of 119015227 in words is "one hundred nineteen million, fifteen thousand, two hundred twenty-seven".