Search a number
-
+
115434053210 = 25713712036919
BaseRepresentation
bin110101110000001100…
…1111101111001011010
3102000221210112111000002
41223200121331321122
53342402104200320
6125010224213002
711224364156120
oct1534031757132
9360853474002
10115434053210
1144a56571783
121a45676a162
13ab68260bc8
145830b91910
1530091dc675
hex1ae067de5a

115434053210 has 32 divisors (see below), whose sum is σ = 239197674240. Its totient is φ = 39288500352.

The previous prime is 115434053209. The next prime is 115434053353. The reversal of 115434053210 is 12350434511.

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

It is a Curzon number.

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, 6008870 + ... + 6028049.

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

Almost surely, 2115434053210 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 12037070.

The product of its (nonzero) digits is 7200, while the sum is 29.

Adding to 115434053210 its reverse (12350434511), we get a palindrome (127784487721).

The spelling of 115434053210 in words is "one hundred fifteen billion, four hundred thirty-four million, fifty-three thousand, two hundred ten".

Divisors: 1 2 5 7 10 14 35 70 137 274 685 959 1370 1918 4795 9590 12036919 24073838 60184595 84258433 120369190 168516866 421292165 842584330 1649057903 3298115806 8245289515 11543405321 16490579030 23086810642 57717026605 115434053210