Search a number
-
+
102011102101000 = 23534127176911939
BaseRepresentation
bin10111001100011101001111…
…100000001111111000001000
3111101012011111002201112201201
4113030131033200033320020
5101332322214114213000
61000543130420153544
730326026131015601
oct2714351740177010
9441164432645651
10102011102101000
112a55a735791844
12b5365278388b4
1344bc7b4802841
141b29513d4cda8
15bbd8222a896a
hex5cc74f80fe08

102011102101000 has 256 divisors, whose sum is σ = 245770132608000. Its totient is φ = 39607418880000.

The previous prime is 102011102100979. The next prime is 102011102101001. The reversal of 102011102101000 is 101201110201.

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

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

It is not an unprimeable number, because it can be changed into a prime (102011102101001) by changing a digit.

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 63 ways as a sum of consecutive naturals, for example, 8544353031 + ... + 8544364969.

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

Almost surely, 2102011102101000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 102011102101000 its reverse (101201110201), we get a palindrome (102112303211201).

The spelling of 102011102101000 in words is "one hundred two trillion, eleven billion, one hundred two million, one hundred one thousand".