Search a number
-
+
201101000100000 = 2535571113669667
BaseRepresentation
bin101101101110011001111001…
…101011001100100010100000
3222101001001211110120011120220
4231232121321223030202200
5202324314322011200000
61551412305110403040
760234032152620510
oct5556317153144240
9871031743504526
10201101000100000
1159093500956270
121a67a87a060480
13882998730a9b0
1437934a9c63840
15183b1727411a0
hexb6e679acc8a0

201101000100000 has 1152 divisors, whose sum is σ = 885914061871104. Its totient is φ = 38572761600000.

The previous prime is 201101000099917. The next prime is 201101000100001. The reversal of 201101000100000 is 1000101102.

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

It is a super-2 number, since 2×2011010001000002 (a number of 29 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 not an unprimeable number, because it can be changed into a prime (201101000100001) by changing a digit.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 299965167 + ... + 300634833.

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

Almost surely, 2201101000100000 is an apocalyptic number.

201101000100000 is a gapful number since it is divisible by the number (20) 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 201101000100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (442957030935552).

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

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

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

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

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

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

Adding to 201101000100000 its reverse (1000101102), we get a palindrome (201102000201102).

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