Search a number
-
+
101000000000000 = 212512101
BaseRepresentation
bin10110111101101111100101…
…000111110101000000000000
3111020121111122122201221202202
4112331233211013311000000
5101214241000000000000
6554450432013132332
730163003103661263
oct2675574507650000
9436544578657682
10101000000000000
112a1aa94aa32072
12b3b258778a0a8
13444834a41178a
141ad25d7258cda
15ba2396035dd5
hex5bdbe51f5000

101000000000000 has 338 divisors, whose sum is σ = 254968871861442. Its totient is φ = 40000000000000.

The previous prime is 100999999999949. The next prime is 101000000000117. The reversal of 101000000000000 is 101.

It can be written as a sum of positive squares in 13 ways, for example, as 66926535786496 + 34073464213504 = 8180864^2 + 5837248^2 .

It is a sliding number, since 101000000000000 = 1000000000000 + 100000000000000 and 1/1000000000000 + 1/100000000000000 = 0.00000000000101000000000000.

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

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 101000000000000.

It is a congruent number.

It is an unprimeable number.

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 25 ways as a sum of consecutive naturals, for example, 999999999950 + ... + 1000000000050.

Almost surely, 2101000000000000 is an apocalyptic number.

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

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

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

101000000000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 101000000000000 its reverse (101), we get a palindrome (101000000000101).

101000000000000 divided by its reverse (101) gives a 12-th power (1000000000000 = 1012).

The spelling of 101000000000000 in words is "one hundred one trillion", and thus it is an aban number.