Search a number
-
+
145951057 = 722978593
BaseRepresentation
bin10001011001100…
…00100101010001
3101011122002012201
420230300211101
5244330413212
622252123201
73421364200
oct1054604521
9334562181
10145951057
117542720a
1240a66501
1324311c95
1415553237
15cc2eb57
hex8b30951

145951057 has 6 divisors (see below), whose sum is σ = 169779858. Its totient is φ = 125100864.

The previous prime is 145951049. The next prime is 145951063. The reversal of 145951057 is 750159541.

It can be written as a sum of positive squares in only one way, i.e., 92236816 + 53714241 = 9604^2 + 7329^2 .

It is not a de Polignac number, because 145951057 - 23 = 145951049 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1489248 + ... + 1489345.

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

Almost surely, 2145951057 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2978607 (or 2978600 counting only the distinct ones).

The product of its (nonzero) digits is 31500, while the sum is 37.

The square root of 145951057 is about 12081.0205280845. The cubic root of 145951057 is about 526.5048969505.

The spelling of 145951057 in words is "one hundred forty-five million, nine hundred fifty-one thousand, fifty-seven".

Divisors: 1 7 49 2978593 20850151 145951057