Base | Representation |
---|---|
bin | 11101110101001101100001… |
… | …011001010111100101111111 |
3 | 122012112121010120202222102020 |
4 | 131311031201121113211333 |
5 | 114144040100001443403 |
6 | 1143012240431131223 |
7 | 36430613210524263 |
oct | 3565154131274577 |
9 | 565477116688366 |
10 | 131200000031103 |
11 | 38893675705723 |
12 | 1286b532673b13 |
13 | 5829150b810a3 |
14 | 24581846d40a3 |
15 | 1027c2e28d453 |
hex | 77536165797f |
131200000031103 has 64 divisors (see below), whose sum is σ = 187877259440640. Its totient is φ = 81287445431808.
The previous prime is 131200000031081. The next prime is 131200000031117. The reversal of 131200000031103 is 301130000002131.
It is not a de Polignac number, because 131200000031103 - 26 = 131200000031039 is a prime.
It is a super-2 number, since 2×1312000000311032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131200000038103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 122737525 + ... + 123801857.
It is an arithmetic number, because the mean of its divisors is an integer number (2935582178760).
Almost surely, 2131200000031103 is an apocalyptic number.
131200000031103 is a deficient number, since it is larger than the sum of its proper divisors (56677259409537).
131200000031103 is a wasteful number, since it uses less digits than its factorization.
131200000031103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064888.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 131200000031103 its reverse (301130000002131), we get a palindrome (432330000033234).
The spelling of 131200000031103 in words is "one hundred thirty-one trillion, two hundred billion, thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •