Search a number
-
+
100001020101000 = 233533727731310391
BaseRepresentation
bin10110101111001101001101…
…010001111100000110001000
3111010002000010000211000210020
4112233031031101330012020
5101101404042121213000
6552403500123020440
730030556333642524
oct2657151521740610
9433060100730706
10100001020101000
112995521590a157
12b270a4b36a720
1343a50955a04c5
141a9a10a4b2d84
15b863c9121ba0
hex5af34d47c188

100001020101000 has 512 divisors, whose sum is σ = 322651008875520. Its totient is φ = 25767465984000.

The previous prime is 100001020100987. The next prime is 100001020101077. The reversal of 100001020101000 is 101020100001.

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

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 127 ways as a sum of consecutive naturals, for example, 9623805805 + ... + 9623816195.

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

Almost surely, 2100001020101000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100001020101000 its reverse (101020100001), we get a palindrome (100102040201001).

Subtracting from 100001020101000 its reverse (101020100001), we obtain a palindrome (99900000000999).

The spelling of 100001020101000 in words is "one hundred trillion, one billion, twenty million, one hundred one thousand".