Search a number
-
+
102011231133000 = 23325371619225891
BaseRepresentation
bin10111001100011101010111…
…001100011101110101001000
3111101012011211002112001100200
4113030131113030131311020
5101332323000132224000
61000543151305532200
730326032255535310
oct2714352714356510
9441164732461320
10102011231133000
112a55a7a1602462
12b536562aa4060
1344bc80546c837
141b2952713a440
15bbd82d795500
hex5cc75731dd48

102011231133000 has 192 divisors, whose sum is σ = 394054813077120. Its totient is φ = 23316852816000.

The previous prime is 102011231132999. The next prime is 102011231133107. The reversal of 102011231133000 is 331132110201.

102011231133000 is a `hidden beast` number, since 1 + 0 + 20 + 1 + 1 + 2 + 311 + 330 + 0 + 0 = 666.

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

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, 809549946 + ... + 809675945.

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

Almost surely, 2102011231133000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 108, while the sum is 18.

Adding to 102011231133000 its reverse (331132110201), we get a palindrome (102342363243201).

The spelling of 102011231133000 in words is "one hundred two trillion, eleven billion, two hundred thirty-one million, one hundred thirty-three thousand".