Search a number
-
+
10131011200210 = 253132680681291
BaseRepresentation
bin1001001101101100111101…
…0100101110010011010010
31022212111220120220210100211
42103123033110232103102
52311441302331401320
633314042225434334
72063640621231235
oct223331724562322
938774816823324
1010131011200210
1132565a07868aa
12117755b19b9aa
1358647268c174
142704b4a1d41c
151287e694b55a
hex936cf52e4d2

10131011200210 has 16 divisors (see below), whose sum is σ = 18824072424192. Its totient is φ = 3921681754800.

The previous prime is 10131011200207. The next prime is 10131011200237. The reversal of 10131011200210 is 1200211013101.

It is a happy number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16340340336 + ... + 16340340955.

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

Almost surely, 210131011200210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 32680681329.

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 10131011200210 its reverse (1200211013101), we get a palindrome (11331222213311).

The spelling of 10131011200210 in words is "ten trillion, one hundred thirty-one billion, eleven million, two hundred thousand, two hundred ten".

Divisors: 1 2 5 10 31 62 155 310 32680681291 65361362582 163403406455 326806812910 1013101120021 2026202240042 5065505600105 10131011200210