Search a number
-
+
145201123 is a prime number
BaseRepresentation
bin10001010011110…
…01011111100011
3101010012222111101
420221321133203
5244132413443
622224055231
73412121614
oct1051713743
9333188441
10145201123
1174a64831
1240764517
132410b832
14153d9c0b
15cb3284d
hex8a797e3

145201123 has 2 divisors, whose sum is σ = 145201124. Its totient is φ = 145201122.

The previous prime is 145201103. The next prime is 145201129. The reversal of 145201123 is 321102541.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 145201123 - 29 = 145200611 is a prime.

It is a super-3 number, since 3×1452011233 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

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

Almost surely, 2145201123 is an apocalyptic number.

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

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

145201123 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 240, while the sum is 19.

The square root of 145201123 is about 12049.9428629351. The cubic root of 145201123 is about 525.6015755713.

Adding to 145201123 its reverse (321102541), we get a palindrome (466303664).

The spelling of 145201123 in words is "one hundred forty-five million, two hundred one thousand, one hundred twenty-three".