Search a number
-
+
145091251 = 4110733073
BaseRepresentation
bin10001010010111…
…10101010110011
3101010000101210001
420221132222303
5244120410001
622221450431
73411153364
oct1051365263
9333011701
10145091251
117499a228
1240710a17
13240a0816
14153abb6b
15cb10001
hex8a5eab3

145091251 has 8 divisors (see below), whose sum is σ = 150023664. Its totient is φ = 140225280.

The previous prime is 145091249. The next prime is 145091257. The reversal of 145091251 is 152190541.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 145091251 - 21 = 145091249 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (145091257) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12150 + ... + 20923.

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

Almost surely, 2145091251 is an apocalyptic number.

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

145091251 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 33221.

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

The square root of 145091251 is about 12045.3829744014. The cubic root of 145091251 is about 525.4689699201.

The spelling of 145091251 in words is "one hundred forty-five million, ninety-one thousand, two hundred fifty-one".

Divisors: 1 41 107 4387 33073 1355993 3538811 145091251