Base | Representation |
---|---|
bin | 111101000001000000… |
… | …0111110000001101101 |
3 | 110112012201122110122021 |
4 | 1322002000332001231 |
5 | 4121322224423041 |
6 | 140110002150141 |
7 | 12316024160401 |
oct | 1720200760155 |
9 | 415181573567 |
10 | 131030311021 |
11 | 5062a216045 |
12 | 21489952351 |
13 | c48249541c |
14 | 64b0267101 |
15 | 361d530cd1 |
hex | 1e8203e06d |
131030311021 has 4 divisors (see below), whose sum is σ = 137926643200. Its totient is φ = 124133978844.
The previous prime is 131030310997. The next prime is 131030311031. The reversal of 131030311021 is 120113030131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131030311021 - 211 = 131030308973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131030310986 and 131030311004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131030311031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3448166061 + ... + 3448166098.
It is an arithmetic number, because the mean of its divisors is an integer number (34481660800).
Almost surely, 2131030311021 is an apocalyptic number.
It is an amenable number.
131030311021 is a deficient number, since it is larger than the sum of its proper divisors (6896332179).
131030311021 is an equidigital number, since it uses as much as digits as its factorization.
131030311021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6896332178.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 131030311021 its reverse (120113030131), we get a palindrome (251143341152).
The spelling of 131030311021 in words is "one hundred thirty-one billion, thirty million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •