Search a number
-
+
101210212311000 = 23353133023858463
BaseRepresentation
bin10111000000110011010110…
…110000001001111111011000
3111021100121020201021210022220
4113000303112300021333120
5101231212003322423000
6555131155112344040
730214124261100612
oct2700632660117730
9437317221253286
10101210212311000
112a281012339711
12b4272733a5020
13446210b3c5b10
141adc859767db2
15ba7a9ad051a0
hex5c0cd6c09fd8

101210212311000 has 256 divisors, whose sum is σ = 340179202621440. Its totient is φ = 24905012774400.

The previous prime is 101210212310969. The next prime is 101210212311031. The reversal of 101210212311000 is 113212012101.

101210212311000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is an interprime number because it is at equal distance from previous prime (101210212310969) and next prime (101210212311031).

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

It is a congruent number.

It is an unprimeable number.

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, 117467769 + ... + 118326231.

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

Almost surely, 2101210212311000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 24, while the sum is 15.

Adding to 101210212311000 its reverse (113212012101), we get a palindrome (101323424323101).

The spelling of 101210212311000 in words is "one hundred one trillion, two hundred ten billion, two hundred twelve million, three hundred eleven thousand".