Search a number
-
+
101010201202000 = 24531012931706657
BaseRepresentation
bin10110111101111001000101…
…001010010100110101010000
3111020122110222121002201011001
4112331321011022110311100
5101214422343001431000
6554455240144231344
730163513643525056
oct2675710512246520
9436573877081131
10101010201202000
112a204205280122
12b3b455400b554
1344492b49b738c
141ad2cc3dd41d6
15ba27918d946a
hex5bde45294d50

101010201202000 has 160 divisors (see below), whose sum is σ = 247502901862944. Its totient is φ = 39867484160000.

The previous prime is 101010201201997. The next prime is 101010201202003. The reversal of 101010201202000 is 202102010101.

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

It can be written as a sum of positive squares in 16 ways, for example, as 955873825344 + 100054327376656 = 977688^2 + 10002716^2 .

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

It is a congruent number.

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

Almost surely, 2101010201202000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 8, while the sum is 10.

Adding to 101010201202000 its reverse (202102010101), we get a palindrome (101212303212101).

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

Divisors: 1 2 4 5 8 10 16 20 25 40 50 80 100 101 125 200 202 250 293 400 404 500 505 586 808 1000 1010 1172 1465 1616 2000 2020 2344 2525 2930 4040 4688 5050 5860 7325 8080 10100 11720 12625 14650 20200 23440 25250 29300 29593 36625 40400 50500 58600 59186 73250 101000 117200 118372 146500 147965 202000 236744 293000 295930 473488 586000 591860 739825 1183720 1479650 1706657 2367440 2959300 3413314 3699125 5918600 6826628 7398250 8533285 11837200 13653256 14796500 17066570 27306512 29593000 34133140 42666425 59186000 68266280 85332850 136532560 170665700 172372357 213332125 341331400 344744714 426664250 500050501 682662800 689489428 853328500 861861785 1000101002 1378978856 1706657000 1723723570 2000202004 2500252505 2757957712 3413314000 3447447140 4000404008 4309308925 5000505010 6894894280 8000808016 8618617850 10001010020 12501262525 13789788560 17237235700 20002020040 21546544625 25002525050 34474471400 40004040080 43093089250 50005050100 50505100601 62506312625 68948942800 86186178500 100010100200 101010201202 125012625250 172372357000 200020200400 202020402404 250025250500 252525503005 344744714000 404040804808 500050501000 505051006010 808081609616 1000101002000 1010102012020 1262627515025 2020204024040 2525255030050 4040408048080 5050510060100 6313137575125 10101020120200 12626275150250 20202040240400 25252550300500 50505100601000 101010201202000