Search a number
-
+
10102001000 = 2353713313581
BaseRepresentation
bin10010110100010000…
…00100110101101000
3222002000200211012012
421122020010311220
5131142103013000
64350224535052
7505223406650
oct113210046550
928060624165
1010102001000
114314352963
121b5b181488
13c4cb819b0
146bb915360
153e1d0a735
hex25a204d68

10102001000 has 256 divisors, whose sum is σ = 30040657920. Its totient is φ = 3093120000.

The previous prime is 10102000939. The next prime is 10102001017. The reversal of 10102001000 is 10020101.

It is a happy number.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2819210 + ... + 2822790.

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

Almost surely, 210102001000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10102001000 its reverse (10020101), we get a palindrome (10112021101).

The spelling of 10102001000 in words is "ten billion, one hundred two million, one thousand".