Search a number
-
+
13012010230 = 252575063039
BaseRepresentation
bin11000001111001001…
…11000010011110110
31020120211101121101211
430013210320103312
5203122033311410
65551100312034
7640310155612
oct140744702366
936524347354
1013012010230
115577a3896a
12263184261a
1312c4a1854b
148b61b4342
1551252568a
hex3079384f6

13012010230 has 16 divisors (see below), whose sum is σ = 23512757760. Its totient is φ = 5184550912.

The previous prime is 13012010213. The next prime is 13012010251. The reversal of 13012010230 is 3201021031.

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

It is a congruent number.

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, 2528950 + ... + 2534089.

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

Almost surely, 213012010230 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 5063303.

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

Adding to 13012010230 its reverse (3201021031), we get a palindrome (16213031261).

The spelling of 13012010230 in words is "thirteen billion, twelve million, ten thousand, two hundred thirty".

Divisors: 1 2 5 10 257 514 1285 2570 5063039 10126078 25315195 50630390 1301201023 2602402046 6506005115 13012010230