Search a number
-
+
150304352627 = 11137573138793
BaseRepresentation
bin1000101111111011010…
…1100110100101110011
3112100221222011020012002
42023332311212211303
54430310403241002
6153014315524215
713600452626462
oct2137665464563
9470858136162
10150304352627
115881a985850
122516875966b
1311234642480
1473bbd789d9
153d9a69d002
hex22fed66973

150304352627 has 16 divisors (see below), whose sum is σ = 176605927008. Its totient is φ = 126111962880.

The previous prime is 150304352621. The next prime is 150304352647. The reversal of 150304352627 is 726253403051.

It is a cyclic number.

It is not a de Polignac number, because 150304352627 - 212 = 150304348531 is a prime.

It is a super-2 number, since 2×1503043526272 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 2150304352627 is an apocalyptic number.

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

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

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

The sum of its prime factors is 146390.

The product of its (nonzero) digits is 151200, while the sum is 38.

Adding to 150304352627 its reverse (726253403051), we get a palindrome (876557755678).

The spelling of 150304352627 in words is "one hundred fifty billion, three hundred four million, three hundred fifty-two thousand, six hundred twenty-seven".

Divisors: 1 11 13 143 7573 83303 98449 138793 1082939 1526723 1804309 19847399 1051079389 11561873279 13664032057 150304352627