Search a number
-
+
102001101010000 = 245414896850309
BaseRepresentation
bin10111001100010011111011…
…011001000111010001010000
3111101011012200002220111000221
4113030103323121013101100
5101332141223324310000
61000534354154122424
730325223241111103
oct2714237331072120
9441135602814027
10102001101010000
112a5564733a2085
12b5345b6420414
1344bb87c82290a
141b28c459c473a
15bbd43928261a
hex5cc4fb647450

102001101010000 has 100 divisors (see below), whose sum is σ = 247120754560900. Its totient is φ = 40773033216000.

The previous prime is 102001101009919. The next prime is 102001101010001. The reversal of 102001101010000 is 10101100201.

It can be written as a sum of positive squares in 10 ways, for example, as 92051820564496 + 9949280445504 = 9594364^2 + 3154248^2 .

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

It is a congruent number.

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

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

Almost surely, 2102001101010000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 102001101010000 its reverse (10101100201), we get a palindrome (102011202110201).

The spelling of 102001101010000 in words is "one hundred two trillion, one billion, one hundred one million, ten thousand".

Divisors: 1 2 4 5 8 10 16 20 25 40 50 80 100 125 200 250 400 500 625 1000 1250 1489 2000 2500 2978 5000 5956 7445 10000 11912 14890 23824 29780 37225 59560 74450 119120 148900 186125 297800 372250 595600 744500 930625 1489000 1861250 2978000 3722500 6850309 7445000 13700618 14890000 27401236 34251545 54802472 68503090 109604944 137006180 171257725 274012360 342515450 548024720 685030900 856288625 1370061800 1712577250 2740123600 3425154500 4281443125 6850309000 8562886250 10200110101 13700618000 17125772500 20400220202 34251545000 40800440404 51000550505 68503090000 81600880808 102001101010 163201761616 204002202020 255002752525 408004404040 510005505050 816008808080 1020011010100 1275013762625 2040022020200 2550027525250 4080044040400 5100055050500 6375068813125 10200110101000 12750137626250 20400220202000 25500275252500 51000550505000 102001101010000