Search a number
-
+
145105051 = 71310914629
BaseRepresentation
bin10001010011000…
…10000010011011
3101010001002201011
420221202002123
5244121330201
622222034351
73411241540
oct1051420233
9333032634
10145105051
11749a9633
12407189b7
13240a6ba0
14153b2bc7
15cb14151
hex8a6209b

145105051 has 16 divisors (see below), whose sum is σ = 180241600. Its totient is φ = 113747328.

The previous prime is 145105039. The next prime is 145105063. The reversal of 145105051 is 150501541.

It is a happy number.

It is an interprime number because it is at equal distance from previous prime (145105039) and next prime (145105063).

It is a cyclic number.

It is not a de Polignac number, because 145105051 - 27 = 145104923 is a prime.

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

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

Almost surely, 2145105051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14758.

The product of its (nonzero) digits is 500, while the sum is 22.

The square root of 145105051 is about 12045.9557943735. The cubic root of 145105051 is about 525.4856289579.

Adding to 145105051 its reverse (150501541), we get a palindrome (295606592).

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

Divisors: 1 7 13 91 109 763 1417 9919 14629 102403 190177 1331239 1594561 11161927 20729293 145105051