Search a number
-
+
102102011000000 = 265611291013169
BaseRepresentation
bin10111001101110001111010…
…000110001011010011000000
3111101111212010200212002212222
4113031301322012023103000
5101340314404304000000
61001053003305310212
730335425004633504
oct2715617206132300
9441455120762788
10102102011000000
112a595246463130
12b550078a95368
1344c8241a15b7b
141b2da99842304
15bc0d9331da85
hex5cdc7a18b4c0

102102011000000 has 784 divisors, whose sum is σ = 288728819848800. Its totient is φ = 35481600000000.

The previous prime is 102102010999993. The next prime is 102102011000111. The reversal of 102102011000000 is 110201201.

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

It is an unprimeable number.

It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 32218998416 + ... + 32219001584.

Almost surely, 2102102011000000 is an apocalyptic number.

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

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

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

102102011000000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 102102011000000 its reverse (110201201), we get a palindrome (102102121201201).

The spelling of 102102011000000 in words is "one hundred two trillion, one hundred two billion, eleven million", and thus it is an aban number.