Search a number
-
+
101001001101000 = 2335371113891093467
BaseRepresentation
bin10110111101110000100000…
…110010101110011011001000
3111020121121020102111011011120
4112331300200302232123020
5101214300022240213000
6554451115214155240
730163036651126140
oct2675604062563310
9436547212434146
10101001001101000
112a200314038070
12b3b2806ab2b20
134448479945b30
141ad26901b1920
15ba2403d836a0
hex5bdc20cae6c8

101001001101000 has 2048 divisors, whose sum is σ = 431906162688000. Its totient is φ = 18973937664000.

The previous prime is 101001001100959. The next prime is 101001001101001. The reversal of 101001001101000 is 101100100101.

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

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

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 511 ways as a sum of consecutive naturals, for example, 29132101267 + ... + 29132104733.

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

Almost surely, 2101001001101000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101001001101000 its reverse (101100100101), we get a palindrome (101102101201101).

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