Search a number
-
+
150361546051 = 294127511213
BaseRepresentation
bin1000110000001000111…
…1110001110101000011
3112101002221202221211001
42030002033301311003
54430420023433201
6153024121432431
713602046024243
oct2140217616503
9471087687731
10150361546051
115884a19a042
122518393b717
1311243448b32
1473c57c5b23
153da06e9301
hex23023f1d43

150361546051 has 4 divisors (see below), whose sum is σ = 150362351392. Its totient is φ = 150360740712.

The previous prime is 150361546033. The next prime is 150361546067. The reversal of 150361546051 is 150645163051.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 150361546051 - 29 = 150361545539 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 150361546051.

It is not an unprimeable number, because it can be changed into a prime (150361546091) 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 3 ways as a sum of consecutive naturals, for example, 38521 + ... + 549733.

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

Almost surely, 2150361546051 is an apocalyptic number.

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

150361546051 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 805340.

The product of its (nonzero) digits is 54000, while the sum is 37.

The spelling of 150361546051 in words is "one hundred fifty billion, three hundred sixty-one million, five hundred forty-six thousand, fifty-one".

Divisors: 1 294127 511213 150361546051