Search a number
-
+
151690000 = 2454711197
BaseRepresentation
bin10010000101010…
…01101100010000
3101120102122120011
421002221230100
5302313040000
623015124304
73521225620
oct1102515420
9346378504
10151690000
1178696a40
1242973694
13255711c7
1416208880
15d4b52ba
hex90a9b10

151690000 has 200 divisors, whose sum is σ = 460202688. Its totient is φ = 47040000.

The previous prime is 151689983. The next prime is 151690013. The reversal of 151690000 is 96151.

It is a tau number, because it is divible by the number of its divisors (200).

It is a super-2 number, since 2×1516900002 = 46019712200000000, which contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 769902 + ... + 770098.

Almost surely, 2151690000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 270, while the sum is 22.

The square root of 151690000 is about 12316.2494291079. The cubic root of 151690000 is about 533.3172738220.

The spelling of 151690000 in words is "one hundred fifty-one million, six hundred ninety thousand".