Search a number
-
+
145621071 = 347125321
BaseRepresentation
bin10001010111000…
…00000001001111
3101011000022120000
420223200001033
5244234333241
622241055343
73415521141
oct1053400117
9334008500
10145621071
11752212a2
1240927553
1324227a1b
14154a8c91
15cbb6eb6
hex8ae004f

145621071 has 20 divisors (see below), whose sum is σ = 220605264. Its totient is φ = 95709600.

The previous prime is 145621061. The next prime is 145621079. The reversal of 145621071 is 170126541.

It is a happy number.

It is not a de Polignac number, because 145621071 - 217 = 145489999 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a congruent number.

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

Almost surely, 2145621071 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 1680, while the sum is 27.

The square root of 145621071 is about 12067.3555926723. The cubic root of 145621071 is about 526.1077995697.

The spelling of 145621071 in words is "one hundred forty-five million, six hundred twenty-one thousand, seventy-one".

Divisors: 1 3 9 27 71 81 213 639 1917 5751 25321 75963 227889 683667 1797791 2051001 5393373 16180119 48540357 145621071