Search a number
-
+
101110002000000 = 2735675994019
BaseRepresentation
bin10110111111010110000001…
…110000001010000010000000
3111021000000120212220112121220
4112333112001300022002000
5101223041241003000000
6555013143233515040
730203646051361530
oct2677260160120200
9437000525815556
10101110002000000
112a242569218874
12b40b967112a80
13445582b15bac6
141ad7a707dd4c0
15ba51833c61a0
hex5bf581c0a080

101110002000000 has 896 divisors, whose sum is σ = 384407579520000. Its totient is φ = 23066534400000.

The previous prime is 101110001999953. The next prime is 101110002000011. The reversal of 101110002000000 is 200011101.

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

It is a tau number, because it is divible by the number of its divisors (896).

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 an unprimeable number.

It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 25157997991 + ... + 25158002009.

Almost surely, 2101110002000000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101110002000000 its reverse (200011101), we get a palindrome (101110202011101).

The spelling of 101110002000000 in words is "one hundred one trillion, one hundred ten billion, two million", and thus it is an aban number.