Search a number
-
+
16145150613 = 325912077081
BaseRepresentation
bin11110000100101001…
…10111001010010101
31112200011221122000020
433002110313022111
5231031124304423
611230022335353
71111043341644
oct170224671225
945604848006
1016145150613
116935575689
123166b8a559
1316a3b77a77
14ad235735b
156476184e3
hex3c2537295

16145150613 has 8 divisors (see below), whose sum is σ = 21535186176. Its totient is φ = 10759274400.

The previous prime is 16145150561. The next prime is 16145150629. The reversal of 16145150613 is 31605154161.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 16145150613 - 221 = 16143053461 is a prime.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1030768 + ... + 1046313.

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

Almost surely, 216145150613 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2079675.

The product of its (nonzero) digits is 10800, while the sum is 33.

The spelling of 16145150613 in words is "sixteen billion, one hundred forty-five million, one hundred fifty thousand, six hundred thirteen".

Divisors: 1 3 2591 7773 2077081 6231243 5381716871 16145150613