Base | Representation |
---|---|
bin | 111101000000011011… |
… | …1110011001111010001 |
3 | 110112011101112222122222 |
4 | 1322000313303033101 |
5 | 4121302322132241 |
6 | 140104035110425 |
7 | 12315402143111 |
oct | 1720067631721 |
9 | 415141488588 |
10 | 131011130321 |
11 | 5061a405325 |
12 | 21483442415 |
13 | c47b50abb6 |
14 | 64ab8b3041 |
15 | 361b9e2a4b |
hex | 1e80df33d1 |
131011130321 has 4 divisors (see below), whose sum is σ = 131012347812. Its totient is φ = 131009912832.
The previous prime is 131011130317. The next prime is 131011130329. The reversal of 131011130321 is 123031110131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 58607083921 + 72404046400 = 242089^2 + 269080^2 .
It is a cyclic number.
It is not a de Polignac number, because 131011130321 - 22 = 131011130317 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131011130321.
It is not an unprimeable number, because it can be changed into a prime (131011130329) 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, 429800 + ... + 668393.
It is an arithmetic number, because the mean of its divisors is an integer number (32753086953).
Almost surely, 2131011130321 is an apocalyptic number.
It is an amenable number.
131011130321 is a deficient number, since it is larger than the sum of its proper divisors (1217491).
131011130321 is a wasteful number, since it uses less digits than its factorization.
131011130321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1217490.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 131011130321 its reverse (123031110131), we get a palindrome (254042240452).
The spelling of 131011130321 in words is "one hundred thirty-one billion, eleven million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •