Search a number
-
+
101101010010000 = 243547111319374789
BaseRepresentation
bin10110111111001101101001…
…110010011011111110010000
3111020222011101012220010021020
4112333031221302123332100
5101222414332030310000
6555005055100155440
730203210163621330
oct2677155162337620
9436864335803236
10101101010010000
112a2397744a8680
12b40a077838b80
134454a27254670
141ad745a4b10c0
15ba4d08c7cba0
hex5bf369c9bf90

101101010010000 has 3200 divisors, whose sum is σ = 473828406374400. Its totient is φ = 17871114240000.

The previous prime is 101101010009953. The next prime is 101101010010001. The reversal of 101101010010000 is 10010101101.

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 not an unprimeable number, because it can be changed into a prime (101101010010001) by changing a digit.

It is a polite number, since it can be written in 639 ways as a sum of consecutive naturals, for example, 21111087606 + ... + 21111092394.

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

Almost surely, 2101101010010000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101101010010000 its reverse (10010101101), we get a palindrome (101111020111101).

It can be divided in two parts, 101 and 101010010000, that added together give a palindrome (101010010101).

The spelling of 101101010010000 in words is "one hundred one trillion, one hundred one billion, ten million, ten thousand".