Search a number
-
+
1001100201000 = 23353709470663
BaseRepresentation
bin11101001000101100011…
…10001100110000101000
310112201000101122102112020
432210112032030300220
5112400223122413000
62043522111344440
7132220124210064
oct16442616146050
93481011572466
101001100201000
11356622a68219
1214202a522120
13735321b9b53
143664c5d8aa4
151b09313bba0
hexe91638cc28

1001100201000 has 128 divisors (see below), whose sum is σ = 3127844678400. Its totient is φ = 266582956800.

The previous prime is 1001100200879. The next prime is 1001100201007. The reversal of 1001100201000 is 1020011001.

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

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

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

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1891669 + ... + 2362331.

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

Almost surely, 21001100201000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1001100201000 its reverse (1020011001), we get a palindrome (1002120212001).

It can be divided in two parts, 1001 and 100201000, that added together give a palindrome (100202001).

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

Divisors: 1 2 3 4 5 6 8 10 12 15 20 24 25 30 40 50 60 75 100 120 125 150 200 250 300 375 500 600 709 750 1000 1418 1500 2127 2836 3000 3545 4254 5672 7090 8508 10635 14180 17016 17725 21270 28360 35450 42540 53175 70900 85080 88625 106350 141800 177250 212700 265875 354500 425400 470663 531750 709000 941326 1063500 1411989 1882652 2127000 2353315 2823978 3765304 4706630 5647956 7059945 9413260 11295912 11766575 14119890 18826520 23533150 28239780 35299725 47066300 56479560 58832875 70599450 94132600 117665750 141198900 176498625 235331500 282397800 333700067 352997250 470663000 667400134 705994500 1001100201 1334800268 1411989000 1668500335 2002200402 2669600536 3337000670 4004400804 5005501005 6674001340 8008801608 8342501675 10011002010 13348002680 16685003350 20022004020 25027505025 33370006700 40044008040 41712508375 50055010050 66740013400 83425016750 100110020100 125137525125 166850033500 200220040200 250275050250 333700067000 500550100500 1001100201000