Search a number
-
+
151012105536 = 26329149191953
BaseRepresentation
bin1000110010100100000…
…1011101110101000000
3112102210021220210122210
42030221001131311000
54433233044334121
6153212441302120
713624135501155
oct2145101356500
9472707823583
10151012105536
1159053440006
1225325794940
1311318167686
147447d7022c
153ddc8a2876
hex232905dd40

151012105536 has 224 divisors, whose sum is σ = 418722048000. Its totient is φ = 47972270080.

The previous prime is 151012105513. The next prime is 151012105547. The reversal of 151012105536 is 635501210151.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 158459236 + ... + 158460188.

Almost surely, 2151012105536 is an apocalyptic number.

151012105536 is a gapful number since it is divisible by the number (16) 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 151012105536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209361024000).

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

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

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 30.

Adding to 151012105536 its reverse (635501210151), we get a palindrome (786513315687).

The spelling of 151012105536 in words is "one hundred fifty-one billion, twelve million, one hundred five thousand, five hundred thirty-six".