Search a number
-
+
152092160000 = 21254112491
BaseRepresentation
bin1000110110100101100…
…1100011000000000000
3112112120120020020211222
42031221121203000000
54442441043110000
6153511542454212
713662662013044
oct2155131430000
9475516206758
10152092160000
1159558071a00
1225587434368
131145ab53961
14750b59a024
153e525e8a85
hex2369663000

152092160000 has 390 divisors, whose sum is σ = 418605281556. Its totient is φ = 55193600000.

The previous prime is 152092159997. The next prime is 152092160009. The reversal of 152092160000 is 61290251.

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

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

It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 309759755 + ... + 309760245.

Almost surely, 2152092160000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 26.

The spelling of 152092160000 in words is "one hundred fifty-two billion, ninety-two million, one hundred sixty thousand".