Search a number
-
+
1002101100000 = 25355711134771
BaseRepresentation
bin11101001010100011110…
…00010100110111100000
310112210121011000100211120
432211101320110313200
5112404300340200000
62044205304212240
7132253666544010
oct16452170246740
93483534010746
101002101100000
11356a96a45480
1214226976a080
1373661680290
14367054dbc40
151b100e496a0
hexe951e14de0

1002101100000 has 2304 divisors, whose sum is σ = 4571995373568. Its totient is φ = 185472000000.

The previous prime is 1002101099939. The next prime is 1002101100001. The reversal of 1002101100000 is 11012001.

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

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

It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 14114099965 + ... + 14114100035.

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

Almost surely, 21002101100000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1002101100000 its reverse (11012001), we get a palindrome (1002112112001).

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