Search a number
-
+
101002000101000 = 23353972293074937
BaseRepresentation
bin10110111101110001011100…
…010101100110111010001000
3111020121200211001021121112120
4112331301130111212322020
5101214304044011213000
6554451402302211240
730163103501363445
oct2675613425467210
9436550731247476
10101002000101000
112a200786a385a9
12b3b2a45583b20
1344485a88c2aab
141ad2746b3c9cc
15ba24619186a0
hex5bdc5c566e88

101002000101000 has 512 divisors, whose sum is σ = 320871808857600. Its totient is φ = 26447988326400.

The previous prime is 101002000100867. The next prime is 101002000101001. The reversal of 101002000101000 is 101000200101.

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

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 20458170532 + ... + 20458175468.

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

Almost surely, 2101002000101000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101002000101000 its reverse (101000200101), we get a palindrome (101103000301101).

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