Base | Representation |
---|---|
bin | 111101000000110001… |
… | …0000100100010010100 |
3 | 110112012011101221210122 |
4 | 1322001202010202110 |
5 | 4121313141224340 |
6 | 140105112411112 |
7 | 12315565263665 |
oct | 1720142044224 |
9 | 415164357718 |
10 | 131022211220 |
11 | 5062569359a |
12 | 214870a6a98 |
13 | c4808ba744 |
14 | 64ad15936c |
15 | 361c980db5 |
hex | 1e81884894 |
131022211220 has 24 divisors (see below), whose sum is σ = 276666798408. Its totient is φ = 52119331200.
The previous prime is 131022211211. The next prime is 131022211241. The reversal of 131022211220 is 22112220131.
It can be written as a sum of positive squares in 4 ways, for example, as 12457684996 + 118564526224 = 111614^2 + 344332^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18093371 + ... + 18100610.
It is an arithmetic number, because the mean of its divisors is an integer number (11527783267).
Almost surely, 2131022211220 is an apocalyptic number.
131022211220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131022211220 is an abundant number, since it is smaller than the sum of its proper divisors (145644587188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131022211220 is a wasteful number, since it uses less digits than its factorization.
131022211220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36194171 (or 36194169 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 131022211220 its reverse (22112220131), we get a palindrome (153134431351).
The spelling of 131022211220 in words is "one hundred thirty-one billion, twenty-two million, two hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •