Base | Representation |
---|---|
bin | 11101110010010011100010… |
… | …100110101100100111001101 |
3 | 122011211111200110001220221212 |
4 | 131302103202212230213031 |
5 | 114132302110401314041 |
6 | 1142340413051104205 |
7 | 36410313443153600 |
oct | 3562234246544715 |
9 | 564744613056855 |
10 | 131000304323021 |
11 | 38816a0a68a551 |
12 | 128388a0a42065 |
13 | 5813377903403 |
14 | 244c63cbc2337 |
15 | 10229428c48eb |
hex | 7724e29ac9cd |
131000304323021 has 12 divisors (see below), whose sum is σ = 152427970199232. Its totient is φ = 112256603805528.
The previous prime is 131000304323011. The next prime is 131000304323029. The reversal of 131000304323021 is 120323403000131.
It is not a de Polignac number, because 131000304323021 - 234 = 130983124453837 is a prime.
It is a super-2 number, since 2×1310003043230212 (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 (131000304323029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 349469435 + ... + 349844088.
It is an arithmetic number, because the mean of its divisors is an integer number (12702330849936).
Almost surely, 2131000304323021 is an apocalyptic number.
It is an amenable number.
131000304323021 is a deficient number, since it is larger than the sum of its proper divisors (21427665876211).
131000304323021 is an equidigital number, since it uses as much as digits as its factorization.
131000304323021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 699317360 (or 699317353 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 131000304323021 its reverse (120323403000131), we get a palindrome (251323707323152).
The spelling of 131000304323021 in words is "one hundred thirty-one trillion, three hundred four million, three hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •