Search a number
-
+
150651148057958 = 275325574028979
BaseRepresentation
bin100010010000010000110100…
…001010100011110101100110
3201202102002221112102101222202
4202100100310022203311212
5124221232022400323313
61252224103150454502
743506120614006042
oct4220206412436546
9652362845371882
10150651148057958
114400287a67a839
1214a91250804432
13660a45b072272
14292b7a967d022
151263bae81c558
hex8904342a3d66

150651148057958 has 4 divisors (see below), whose sum is σ = 225976722086940. Its totient is φ = 75325574028978.

The previous prime is 150651148057933. The next prime is 150651148057981. The reversal of 150651148057958 is 859750841156051.

It is a semiprime because it is the product of two primes.

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

It is a junction number, because it is equal to n+sod(n) for n = 150651148057894 and 150651148057903.

It is a congruent number.

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 as a sum of consecutive naturals, namely, 37662787014488 + ... + 37662787014491.

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

Almost surely, 2150651148057958 is an apocalyptic number.

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

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

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

The sum of its prime factors is 75325574028981.

The product of its (nonzero) digits is 60480000, while the sum is 65.

The spelling of 150651148057958 in words is "one hundred fifty trillion, six hundred fifty-one billion, one hundred forty-eight million, fifty-seven thousand, nine hundred fifty-eight".

Divisors: 1 2 75325574028979 150651148057958