Search a number
-
+
10512015320 = 2356126316381
BaseRepresentation
bin10011100101001000…
…01001111111011000
31000010121012201002202
421302210021333120
5133012033442240
64455032545332
7521332440662
oct116244117730
930117181082
1010512015320
114504838774
122054552248
13cb6abb511
1471a165532
15417ceb315
hex272909fd8

10512015320 has 64 divisors (see below), whose sum is σ = 24132651840. Its totient is φ = 4119897600.

The previous prime is 10512015281. The next prime is 10512015329. The reversal of 10512015320 is 2351021501.

It is a happy number.

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

It is a super-2 number, since 2×105120153202 (a number of 21 digits) contains 22 as substring.

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

It is a junction number, because it is equal to n+sod(n) for n = 10512015292 and 10512015301.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10512015329) by changing a digit.

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

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

Almost surely, 210512015320 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 300, while the sum is 20.

Adding to 10512015320 its reverse (2351021501), we get a palindrome (12863036821).

The spelling of 10512015320 in words is "ten billion, five hundred twelve million, fifteen thousand, three hundred twenty".

Divisors: 1 2 4 5 8 10 20 40 61 122 244 263 305 488 526 610 1052 1220 1315 2104 2440 2630 5260 10520 16043 16381 32086 32762 64172 65524 80215 81905 128344 131048 160430 163810 320860 327620 641720 655240 999241 1998482 3996964 4308203 4996205 7993928 8616406 9992410 17232812 19984820 21541015 34465624 39969640 43082030 86164060 172328120 262800383 525600766 1051201532 1314001915 2102403064 2628003830 5256007660 10512015320