Base | Representation |
---|---|
bin | 111101000110101100… |
… | …0110110010011100111 |
3 | 110112201000200120200001 |
4 | 1322031120312103213 |
5 | 4122220101321411 |
6 | 140140540002131 |
7 | 12323532055435 |
oct | 1721530662347 |
9 | 415630616601 |
10 | 131221120231 |
11 | 507179a0903 |
12 | 21521830347 |
13 | c4b2b82296 |
14 | 64cb735d55 |
15 | 3630171dc1 |
hex | 1e8d6364e7 |
131221120231 has 32 divisors (see below), whose sum is σ = 148159872000. Its totient is φ = 115593350400.
The previous prime is 131221120211. The next prime is 131221120267. The reversal of 131221120231 is 132021122131.
It is a cyclic number.
It is not a de Polignac number, because 131221120231 - 211 = 131221118183 is a prime.
It is a super-2 number, since 2×1312211202312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 131221120199 and 131221120208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131221120211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22617531 + ... + 22623331.
It is an arithmetic number, because the mean of its divisors is an integer number (4629996000).
Almost surely, 2131221120231 is an apocalyptic number.
131221120231 is a deficient number, since it is larger than the sum of its proper divisors (16938751769).
131221120231 is a wasteful number, since it uses less digits than its factorization.
131221120231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7279.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 131221120231 its reverse (132021122131), we get a palindrome (263242242362).
The spelling of 131221120231 in words is "one hundred thirty-one billion, two hundred twenty-one million, one hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •