Search a number
-
+
1001051105100 = 2235253547911491
BaseRepresentation
bin11101001000100110100…
…10111010011101001100
310112200212222021002121120
432210103102322131030
5112400123040330400
62043513155200540
7132215656666254
oct16442322723514
93480788232546
101001051105100
113565a82847a2
12142015ba6150
1373524c8a117
1436645c98964
151b08db8eca0
hexe9134ba74c

1001051105100 has 144 divisors (see below), whose sum is σ = 2951818571520. Its totient is φ = 261839635200.

The previous prime is 1001051105099. The next prime is 1001051105113. The reversal of 1001051105100 is 15011501001.

1001051105100 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 87110355 + ... + 87121845.

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

Almost surely, 21001051105100 is an apocalyptic number.

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

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

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

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

1001051105100 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 25, while the sum is 15.

Adding to 1001051105100 its reverse (15011501001), we get a palindrome (1016062606101).

The spelling of 1001051105100 in words is "one trillion, one billion, fifty-one million, one hundred five thousand, one hundred".

Divisors: 1 2 3 4 5 6 10 12 15 20 25 30 50 53 60 75 100 106 150 159 212 265 300 318 530 636 795 1060 1325 1590 2650 3180 3975 5300 5479 7950 10958 11491 15900 16437 21916 22982 27395 32874 34473 45964 54790 57455 65748 68946 82185 109580 114910 136975 137892 164370 172365 229820 273950 287275 290387 328740 344730 410925 547900 574550 580774 609023 689460 821850 861825 871161 1149100 1161548 1218046 1451935 1643700 1723650 1742322 1827069 2436092 2903870 3045115 3447300 3484644 3654138 4355805 5807740 6090230 7259675 7308276 8711610 9135345 12180460 14519350 15225575 17423220 18270690 21779025 29038700 30451150 36541380 43558050 45676725 60902300 62959189 87116100 91353450 125918378 182706900 188877567 251836756 314795945 377755134 629591890 755510268 944387835 1259183780 1573979725 1888775670 3147959450 3336837017 3777551340 4721939175 6295918900 6673674034 9443878350 10010511051 13347348068 16684185085 18887756700 20021022102 33368370170 40042044204 50052555255 66736740340 83420925425 100105110510 166841850850 200210221020 250262776275 333683701700 500525552550 1001051105100