Search a number
-
+
150116701065 = 3510007780071
BaseRepresentation
bin1000101111001110100…
…1110001001110001001
3112100110220001112122020
42023303221301032021
54424414333413230
6152543533515053
713563013622412
oct2136351611611
9470426045566
10150116701065
1158733a67411
1225115942a89
13112047bc946
1473a108c809
153d88e82810
hex22f3a71389

150116701065 has 8 divisors (see below), whose sum is σ = 240186721728. Its totient is φ = 80062240560.

The previous prime is 150116701003. The next prime is 150116701121. The reversal of 150116701065 is 560107611051.

150116701065 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 150116701065 - 29 = 150116700553 is a prime.

It is an unprimeable number.

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

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

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

Almost surely, 2150116701065 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 10007780079.

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

The spelling of 150116701065 in words is "one hundred fifty billion, one hundred sixteen million, seven hundred one thousand, sixty-five".

Divisors: 1 3 5 15 10007780071 30023340213 50038900355 150116701065