Search a number
-
+
102120101200 = 245213232929443
BaseRepresentation
bin101111100011011010…
…1010001010101010000
3100202120220222122100101
41133012311101111100
53133120221214300
6114525140102144
710243426352365
oct1370665212520
9322526878311
10102120101200
113a344153557
121795b994954
139825b17ab0
144d2a86046c
1529ca422b6a
hex17c6d51550

102120101200 has 240 divisors, whose sum is σ = 285220494720. Its totient is φ = 34821642240.

The previous prime is 102120101137. The next prime is 102120101219. The reversal of 102120101200 is 2101021201.

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

It is a congruent number.

It is an unprimeable number.

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

It is an arithmetic number, because the mean of its divisors is an integer number (1188418728).

Almost surely, 2102120101200 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 8, while the sum is 10.

Adding to 102120101200 its reverse (2101021201), we get a palindrome (104221122401).

The spelling of 102120101200 in words is "one hundred two billion, one hundred twenty million, one hundred one thousand, two hundred".