Search a number
-
+
13015200210 = 2352318862609
BaseRepresentation
bin11000001111100010…
…00011000111010010
31020121001101200020020
430013301003013102
5203123342401320
65551252524310
7640346243055
oct140761030722
936531350206
1013015200210
115579817611
122632920696
1312c55944cc
148b67a4a9c
15512955940
hex307c431d2

13015200210 has 32 divisors (see below), whose sum is σ = 32594590080. Its totient is φ = 3319819008.

The previous prime is 13015200197. The next prime is 13015200227. The reversal of 13015200210 is 1200251031.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9430615 + ... + 9431994.

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

Almost surely, 213015200210 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 18862642.

The product of its (nonzero) digits is 60, while the sum is 15.

Adding to 13015200210 its reverse (1200251031), we get a palindrome (14215451241).

The spelling of 13015200210 in words is "thirteen billion, fifteen million, two hundred thousand, two hundred ten".

Divisors: 1 2 3 5 6 10 15 23 30 46 69 115 138 230 345 690 18862609 37725218 56587827 94313045 113175654 188626090 282939135 433840007 565878270 867680014 1301520021 2169200035 2603040042 4338400070 6507600105 13015200210