Base | Representation |
---|---|
bin | 111101001001101011… |
… | …0010101000100111011 |
3 | 110112221222212020212011 |
4 | 1322103112111010323 |
5 | 4122421201420011 |
6 | 140154511230351 |
7 | 12326155062202 |
oct | 1722326250473 |
9 | 415858766764 |
10 | 131321123131 |
11 | 50769394530 |
12 | 2154b2183b7 |
13 | c4ca7c71b3 |
14 | 64dab28239 |
15 | 3638d27621 |
hex | 1e9359513b |
131321123131 has 8 divisors (see below), whose sum is σ = 143265310128. Its totient is φ = 119377920000.
The previous prime is 131321123119. The next prime is 131321123149.
131321123131 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131321123131 - 215 = 131321090363 is a prime.
It is a super-2 number, since 2×1313211231312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131321129131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48451 + ... + 514771.
It is an arithmetic number, because the mean of its divisors is an integer number (17908163766).
Almost surely, 2131321123131 is an apocalyptic number.
131321123131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131321123131 is a deficient number, since it is larger than the sum of its proper divisors (11944186997).
131321123131 is a wasteful number, since it uses less digits than its factorization.
131321123131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 491933.
The product of its digits is 324, while the sum is 22.
It can be divided in two parts, 131321 and 123131, that added together give a palindrome (254452).
The spelling of 131321123131 in words is "one hundred thirty-one billion, three hundred twenty-one million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •