Search a number
-
+
101010111000 = 23353377911519
BaseRepresentation
bin101111000010010101…
…0111111101000011000
3100122201120100022001020
41132010222333220120
53123332042023000
6114223045122440
710204060530351
oct1360452775030
9318646308036
10101010111000
1139924635487
12176b00b9420
1396a9b79b66
144c63280d28
152962c66ba0
hex1784abfa18

101010111000 has 256 divisors, whose sum is σ = 327794688000. Its totient is φ = 25874035200.

The previous prime is 101010110983. The next prime is 101010111001. The reversal of 101010111000 is 111010101.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101010111001) 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 63 ways as a sum of consecutive naturals, for example, 8763241 + ... + 8774759.

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

Almost surely, 2101010111000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101010111000 its reverse (111010101), we get a palindrome (101121121101).

The spelling of 101010111000 in words is "one hundred one billion, ten million, one hundred eleven thousand".