Search a number
-
+
131000514110 = 25587181112323
BaseRepresentation
bin111101000000000111…
…1010011011000111110
3110112010122120121221222
41322000033103120332
54121242112422420
6140103015353342
712315212666054
oct1720017233076
9415118517858
10131000514110
11506144141a4
122147b982852
13c479261a0b
1464aa30c1d4
15361aae7225
hex1e803d363e

131000514110 has 32 divisors (see below), whose sum is σ = 236352235392. Its totient is φ = 52277810080.

The previous prime is 131000514109. The next prime is 131000514133. The reversal of 131000514110 is 11415000131.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2131000514110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 14728.

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

Adding to 131000514110 its reverse (11415000131), we get a palindrome (142415514241).

The spelling of 131000514110 in words is "one hundred thirty-one billion, five hundred fourteen thousand, one hundred ten".

Divisors: 1 2 5 10 587 1174 1811 2935 3622 5870 9055 12323 18110 24646 61615 123230 1063057 2126114 5315285 7233601 10630570 14467202 22316953 36168005 44633906 72336010 111584765 223169530 13100051411 26200102822 65500257055 131000514110