Search a number
-
+
131056452010 = 25111191422291
BaseRepresentation
bin111101000001110010…
…0101100000110101010
3110112021112211120100001
41322003210230012222
54121400422431020
6140112334333214
712316462314241
oct1720344540652
9415245746301
10131056452010
1150642a50170
122149665a20a
13c487a18a73
1464b390d958
15362099650a
hex1e8392c1aa

131056452010 has 16 divisors (see below), whose sum is σ = 257347215072. Its totient is φ = 47656891600.

The previous prime is 131056452001. The next prime is 131056452011. The reversal of 131056452010 is 10254650131.

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

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

It is not an unprimeable number, because it can be changed into a prime (131056452011) 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 7 ways as a sum of consecutive naturals, for example, 595711036 + ... + 595711255.

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

Almost surely, 2131056452010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1191422309.

The product of its (nonzero) digits is 3600, while the sum is 28.

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

Divisors: 1 2 5 10 11 22 55 110 1191422291 2382844582 5957111455 11914222910 13105645201 26211290402 65528226005 131056452010