Base | Representation |
---|---|
bin | 11101000101100101… |
… | …000111110001001001 |
3 | 2222121121202121011001 |
4 | 131011211013301021 |
5 | 1002430411130441 |
6 | 22203044535001 |
7 | 2153650503643 |
oct | 350545076111 |
9 | 88547677131 |
10 | 31232130121 |
11 | 122777a5695 |
12 | 60776b1461 |
13 | 2c39728c8a |
14 | 1723d3d893 |
15 | c2bdae731 |
hex | 745947c49 |
31232130121 has 4 divisors (see below), whose sum is σ = 31240721092. Its totient is φ = 31223539152.
The previous prime is 31232130107. The next prime is 31232130133. The reversal of 31232130121 is 12103123213.
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 872552521 + 30359577600 = 29539^2 + 174240^2 .
It is a cyclic number.
It is not a de Polignac number, because 31232130121 - 27 = 31232129993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31232110121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4290030 + ... + 4297303.
It is an arithmetic number, because the mean of its divisors is an integer number (7810180273).
Almost surely, 231232130121 is an apocalyptic number.
It is an amenable number.
31232130121 is a deficient number, since it is larger than the sum of its proper divisors (8590971).
31232130121 is an equidigital number, since it uses as much as digits as its factorization.
31232130121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8590970.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 31232130121 its reverse (12103123213), we get a palindrome (43335253334).
The spelling of 31232130121 in words is "thirty-one billion, two hundred thirty-two million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •