Search a number
-
+
101320131000000 = 263561173137307
BaseRepresentation
bin10111000010011001101110…
…011010101011011011000000
3111021202002222010200201222110
4113002121232122223123000
5101240012112014000000
6555253454155335320
730225065204405013
oct2702315632533300
9437662863621873
10101320131000000
112a3136985a2650
12b44462aa51540
13446c5a7ac39b3
141b03cc5c2337a
15baa880bda850
hex5c266e6ab6c0

101320131000000 has 1568 divisors, whose sum is σ = 374482011568896. Its totient is φ = 23970816000000.

The previous prime is 101320130999993. The next prime is 101320131000001. The reversal of 101320131000000 is 131023101.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 101320131000000.

It is not an unprimeable number, because it can be changed into a prime (101320131000001) 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 223 ways as a sum of consecutive naturals, for example, 330032999847 + ... + 330033000153.

Almost surely, 2101320131000000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101320131000000 its reverse (131023101), we get a palindrome (101320262023101).

The spelling of 101320131000000 in words is "one hundred one trillion, three hundred twenty billion, one hundred thirty-one million", and thus it is an aban number.