Search a number
-
+
150045511213 = 1373315746197
BaseRepresentation
bin1000101110111101101…
…0001100111000101101
3112100021221002201112001
42023233122030320231
54424243122324323
6152532512012301
713561160542003
oct2135732147055
9470257081461
10150045511213
11586a7863424
12250b5b31091
13111c2b25680
14739583aa73
153d82abe3ad
hex22ef68ce2d

150045511213 has 8 divisors (see below), whose sum is σ = 161807930648. Its totient is φ = 138314585664.

The previous prime is 150045511181. The next prime is 150045511229. The reversal of 150045511213 is 312115540051.

It can be written as a sum of positive squares in 4 ways, for example, as 24391567684 + 125653943529 = 156178^2 + 354477^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 150045511213 - 25 = 150045511181 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2150045511213 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 15746943.

The product of its (nonzero) digits is 3000, while the sum is 28.

The spelling of 150045511213 in words is "one hundred fifty billion, forty-five million, five hundred eleven thousand, two hundred thirteen".

Divisors: 1 13 733 9529 15746197 204700561 11541962401 150045511213