Search a number
-
+
145095937 = 7236713451
BaseRepresentation
bin10001010010111…
…11110100000001
3101010000122012121
420221133310001
5244121032222
622221524241
73411203140
oct1051376401
9333018177
10145095937
11749a27a8
1240713681
13240a29ac
14153ad757
15cb115c7
hex8a5fd01

145095937 has 16 divisors (see below), whose sum is σ = 175629312. Its totient is φ = 117176400.

The previous prime is 145095931. The next prime is 145095941. The reversal of 145095937 is 739590541.

It is a cyclic number.

It is not a de Polignac number, because 145095937 - 219 = 144571649 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (145095931) 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 in 15 ways as a sum of consecutive naturals, for example, 4062 + ... + 17512.

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

Almost surely, 2145095937 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13548.

The product of its (nonzero) digits is 170100, while the sum is 43.

The square root of 145095937 is about 12045.5774871942. The cubic root of 145095937 is about 525.4746268684.

The spelling of 145095937 in words is "one hundred forty-five million, ninety-five thousand, nine hundred thirty-seven".

Divisors: 1 7 23 67 161 469 1541 10787 13451 94157 309373 901217 2165611 6308519 20727991 145095937