Search a number
-
+
101962105920 = 263252310311493
BaseRepresentation
bin101111011110101101…
…0100100010001000000
3100202011220200122120100
41132331122210101000
53132304244342140
6114501333442400
710236500412633
oct1367532442100
9322156618510
10101962105920
113a272a50344
1217916aa0400
1397cc17996c
144d13893c1a
1529bb614530
hex17bd6a4440

101962105920 has 336 divisors, whose sum is σ = 366555601152. Its totient is φ = 25965096960.

The previous prime is 101962105891. The next prime is 101962105957. The reversal of 101962105920 is 29501269101.

101962105920 is a `hidden beast` number, since 1 + 0 + 1 + 9 + 62 + 1 + 0 + 592 + 0 = 666.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 68292694 + ... + 68294186.

Almost surely, 2101962105920 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 9720, while the sum is 36.

The spelling of 101962105920 in words is "one hundred one billion, nine hundred sixty-two million, one hundred five thousand, nine hundred twenty".