Search a number
-
+
145023681 = 31113133547
BaseRepresentation
bin10001010010011…
…10001011000001
3101002212222002110
420221032023001
5244111224211
622220205533
73410452365
oct1051161301
9332788073
10145023681
1174953490
12406998a9
1324078b3a
14153912a5
15cae9ea6
hex8a4e2c1

145023681 has 16 divisors (see below), whose sum is σ = 212560128. Its totient is φ = 87219600.

The previous prime is 145023661. The next prime is 145023689. The reversal of 145023681 is 186320541.

It is not a de Polignac number, because 145023681 - 227 = 10805953 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (145023689) 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, 12451 + ... + 21096.

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

Almost surely, 2145023681 is an apocalyptic number.

145023681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 33692.

The product of its (nonzero) digits is 5760, while the sum is 30.

The square root of 145023681 is about 12042.5778386523. The cubic root of 145023681 is about 525.3873857418.

The spelling of 145023681 in words is "one hundred forty-five million, twenty-three thousand, six hundred eighty-one".

Divisors: 1 3 11 33 131 393 1441 4323 33547 100641 369017 1107051 4394657 13183971 48341227 145023681