Search a number
-
+
151532000000 = 285643881
BaseRepresentation
bin1000110100100000000…
…0101101001100000000
3112111010112012011210022
42031020000231030000
54440314143000000
6153340212353012
713643050514363
oct2151000551400
9474115164708
10151532000000
115929a955457
122544b915768
131139ba96b34
1474970240da
153e1d34a585
hex234802d300

151532000000 has 252 divisors, whose sum is σ = 387317073528. Its totient is φ = 59136000000.

The previous prime is 151531999987. The next prime is 151532000027. The reversal of 151532000000 is 235151.

It is an unprimeable number.

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

It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 171999560 + ... + 172000440.

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

Almost surely, 2151532000000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 151532000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193658536764).

151532000000 is an abundant number, since it is smaller than the sum of its proper divisors (235785073528).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

151532000000 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 970 (or 931 counting only the distinct ones).

The product of its (nonzero) digits is 150, while the sum is 17.

Adding to 151532000000 its reverse (235151), we get a palindrome (151532235151).

The spelling of 151532000000 in words is "one hundred fifty-one billion, five hundred thirty-two million", and thus it is an aban number.