Search a number
-
+
151990520000 = 2654112311013
BaseRepresentation
bin1000110110001101010…
…1110100100011000000
3112112022110222101222112
42031203111310203000
54442234033120000
6153453512154452
713660316050364
oct2154325644300
9475273871875
10151990520000
1159505760300
1225559398a28
1311442a87847
1474dbc9d2a4
153e4871d235
hex23635748c0

151990520000 has 420 divisors, whose sum is σ = 428049830208. Its totient is φ = 53433600000.

The previous prime is 151990519981. The next prime is 151990520023. The reversal of 151990520000 is 25099151.

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

It is a Harshad number since it is a multiple of its sum of digits (32).

It is an unprimeable number.

It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 150039494 + ... + 150040506.

Almost surely, 2151990520000 is an apocalyptic number.

151990520000 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 151990520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214024915104).

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

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

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

151990520000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 4050, while the sum is 32.

The spelling of 151990520000 in words is "one hundred fifty-one billion, nine hundred ninety million, five hundred twenty thousand".