Search a number
-
+
101311330223232 = 2732479772323773
BaseRepresentation
bin10111000010010001100001…
…110110011000010010000000
3111021201021020210110221212100
4113002101201312120102000
5101234341101014120412
6555245441012230400
730224334131134503
oct2702214166302200
9437637223427770
10101311330223232
112a30a991803818
12b44299360b400
13446b8046b828c
141b036cd06b13a
15baa518262edc
hex5c2461d98480

101311330223232 has 192 divisors, whose sum is σ = 292192654291200. Its totient is φ = 33694160467968.

The previous prime is 101311330223231. The next prime is 101311330223263. The reversal of 101311330223232 is 232322033113101.

101311330223232 is a `hidden beast` number, since 1 + 0 + 1 + 3 + 1 + 1 + 330 + 2 + 2 + 323 + 2 = 666.

It is a tau number, because it is divible by the number of its divisors (192).

It is a junction number, because it is equal to n+sod(n) for n = 101311330223196 and 101311330223205.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4261601298 + ... + 4261625070.

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

Almost surely, 2101311330223232 is an apocalyptic number.

101311330223232 is a gapful number since it is divisible by the number (12) 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 101311330223232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146096327145600).

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

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

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 27.

Adding to 101311330223232 its reverse (232322033113101), we get a palindrome (333633363336333).

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