Search a number
-
+
10101311310000 = 24354973471241
BaseRepresentation
bin1001001011111110010100…
…0100101000100010110000
31022202200020202100001020010
42102333211010220202300
52310444441143410000
633252251154014520
72061536624310111
oct222774504504260
938680222301203
1010101311310000
113244a3a991799
121171850877440
1358371b532b31
1426cc983b6208
15127b59353d50
hex92fe51288b0

10101311310000 has 200 divisors, whose sum is σ = 32944558104304. Its totient is φ = 2665912320000.

The previous prime is 10101311309993. The next prime is 10101311310007. The reversal of 10101311310000 is 1311310101.

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

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

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

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

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

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1174380 + ... + 4645620.

Almost surely, 210101311310000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10101311310000 its reverse (1311310101), we get a palindrome (10102622620101).

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