Search a number
-
+
910010101000 = 2353711131019001
BaseRepresentation
bin11010011111000001101…
…01000010110100001000
310012222220011112220022211
431033200311002310020
5104402200041213000
61534015230354504
7122513620142320
oct15174065026410
93188804486284
10910010101000
11320a29a83940
1212844865ba34
1367a765a20b0
143208aa18280
1518a112327ba
hexd3e0d42d08

910010101000 has 512 divisors, whose sum is σ = 2887714851840. Its totient is φ = 259200000000.

The previous prime is 910010100953. The next prime is 910010101057. The reversal of 910010101000 is 101010019.

It is a Harshad number since it is a multiple of its sum of digits (13).

It is an unprimeable number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 101096500 + ... + 101105500.

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

Almost surely, 2910010101000 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 910010101000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1443857425920).

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

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

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

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

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

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 910010101000 its reverse (101010019), we get a palindrome (910111111019).

The spelling of 910010101000 in words is "nine hundred ten billion, ten million, one hundred one thousand".