Search a number
-
+
146069535 = 3510139613
BaseRepresentation
bin10001011010011…
…01100000011111
3101011212002201210
420231031200133
5244343211120
622254435503
73422366463
oct1055154037
9334762653
10146069535
11754a8227
1240b02b93
1324353ba1
14155844a3
15cc54ce0
hex8b4d81f

146069535 has 16 divisors (see below), whose sum is σ = 233966304. Its totient is φ = 77818752.

The previous prime is 146069531. The next prime is 146069557. The reversal of 146069535 is 535960641.

146069535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 146069535 - 22 = 146069531 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10389 + ... + 20001.

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

Almost surely, 2146069535 is an apocalyptic number.

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

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

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

146069535 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 10634.

The product of its (nonzero) digits is 97200, while the sum is 39.

The square root of 146069535 is about 12085.9230098491. The cubic root of 146069535 is about 526.6473245491.

The spelling of 146069535 in words is "one hundred forty-six million, sixty-nine thousand, five hundred thirty-five".

Divisors: 1 3 5 15 1013 3039 5065 9613 15195 28839 48065 144195 9737969 29213907 48689845 146069535