Search a number
-
+
10132002130 = 251953326327
BaseRepresentation
bin10010110111110101…
…00001010101010010
3222011010011001000011
421123322201111102
5131222243032010
64353215545134
7506036411545
oct113372412522
928133131004
1010132002130
11432a284188
121b6922b1aa
13c56157343
146c18c485c
153e4784a8a
hex25bea1552

10132002130 has 16 divisors (see below), whose sum is σ = 19197478080. Its totient is φ = 3839495472.

The previous prime is 10132002121. The next prime is 10132002143. The reversal of 10132002130 is 3120023101.

10132002130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a self number, because there is not a number n which added to its sum of digits gives 10132002130.

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

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

Almost surely, 210132002130 is an apocalyptic number.

10132002130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

10132002130 is a deficient number, since it is larger than the sum of its proper divisors (9065475950).

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

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

The sum of its prime factors is 53326353.

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

Adding to 10132002130 its reverse (3120023101), we get a palindrome (13252025231).

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

Divisors: 1 2 5 10 19 38 95 190 53326327 106652654 266631635 533263270 1013200213 2026400426 5066001065 10132002130