Search a number
-
+
146110397 is a prime number
BaseRepresentation
bin10001011010101…
…11011110111101
3101011221011210012
420231113132331
5244401013042
622255353005
73422626556
oct1055273675
9334834705
10146110397
11755259a4
1240b22765
1324369674
141559532d
15cc61e82
hex8b577bd

146110397 has 2 divisors, whose sum is σ = 146110398. Its totient is φ = 146110396.

The previous prime is 146110301. The next prime is 146110477. The reversal of 146110397 is 793011641.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 134420836 + 11689561 = 11594^2 + 3419^2 .

It is a cyclic number.

It is not a de Polignac number, because 146110397 - 220 = 145061821 is a prime.

It is a super-2 number, since 2×1461103972 = 42696496222995218, which contains 22 as substring.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2146110397 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 146110397 is about 12087.6133707196. The cubic root of 146110397 is about 526.6964286890.

The spelling of 146110397 in words is "one hundred forty-six million, one hundred ten thousand, three hundred ninety-seven".