Search a number
-
+
101001010200 = 23352792817583
BaseRepresentation
bin101111000010000100…
…0010001110000011000
3100122200221012221002120
41132010020101300120
53123322224311300
6114222122101240
710203620264406
oct1360410216030
9318627187076
10101001010200
113991a489962
12176a904a820
1396a801167c
144c61d92476
15296206a3a0
hex1784211c18

101001010200 has 192 divisors, whose sum is σ = 318236774400. Its totient is φ = 26494540800.

The previous prime is 101001010199. The next prime is 101001010223. The reversal of 101001010200 is 2010100101.

It is a super-2 number, since 2×1010010102002 (a number of 23 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 congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2101001010200 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101001010200 its reverse (2010100101), we get a palindrome (103011110301).

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