Search a number
-
+
135300251065100 = 225211237764339541
BaseRepresentation
bin11110110000111000001011…
…011001110001101100001100
3122202001120121010110212111112
4132300320023121301230030
5120213224403233040400
61155432024404511152
740333056231335432
oct3660701331615414
9582046533425445
10135300251065100
113a124572501a00
12132121183ab4b8
135a659b34a1484
14255a7d215cd52
15109970b51d835
hex7b0e0b671b0c

135300251065100 has 216 divisors, whose sum is σ = 331492938604464. Its totient is φ = 47862885312000.

The previous prime is 135300251065097. The next prime is 135300251065123. The reversal of 135300251065100 is 1560152003531.

It is an unprimeable number.

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

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 3421751330 + ... + 3421790870.

Almost surely, 2135300251065100 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 135300251065100 in words is "one hundred thirty-five trillion, three hundred billion, two hundred fifty-one million, sixty-five thousand, one hundred".