Search a number
-
+
100056001502700 = 2232522331155923331
BaseRepresentation
bin10110110000000000011010…
…011011010101110111101100
3111010021021000210000121220100
4112300000122123111313230
5101103304142341041300
6552445031553151100
730034543664102355
oct2660003233256754
9433237023017810
10100056001502700
112997656a437011
12b27b63455b490
1343aa3183896a9
141a9ca44622d2c
15b87a45e97700
hex5b001a6d5dec

100056001502700 has 216 divisors, whose sum is σ = 337812264631296. Its totient is φ = 24698255472000.

The previous prime is 100056001502671. The next prime is 100056001502713. The reversal of 100056001502700 is 7205100650001.

100056001502700 is a `hidden beast` number, since 1 + 0 + 0 + 0 + 5 + 600 + 1 + 50 + 2 + 7 + 0 + 0 = 666.

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

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, 77319966 + ... + 78603365.

Almost surely, 2100056001502700 is an apocalyptic number.

100056001502700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 2100, while the sum is 27.

The spelling of 100056001502700 in words is "one hundred trillion, fifty-six billion, one million, five hundred two thousand, seven hundred".