Base | Representation |
---|---|
bin | 11101000100010011… |
… | …001010101110011111 |
3 | 2222120010100010001211 |
4 | 131010103022232133 |
5 | 1002404411141211 |
6 | 22201000245251 |
7 | 2153300055166 |
oct | 350423125637 |
9 | 88503303054 |
10 | 31210646431 |
11 | 12266661678 |
12 | 6070470827 |
13 | 2c35146433 |
14 | 172114a3dd |
15 | c2a068e21 |
hex | 7444cab9f |
31210646431 has 4 divisors (see below), whose sum is σ = 31213747000. Its totient is φ = 31207545864.
The previous prime is 31210646359. The next prime is 31210646447. The reversal of 31210646431 is 13464601213.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31210646431 is a prime.
It is a super-2 number, since 2×312106464312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31210646393 and 31210646402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31210616431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1535136 + ... + 1555333.
It is an arithmetic number, because the mean of its divisors is an integer number (7803436750).
Almost surely, 231210646431 is an apocalyptic number.
31210646431 is a deficient number, since it is larger than the sum of its proper divisors (3100569).
31210646431 is a wasteful number, since it uses less digits than its factorization.
31210646431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3100568.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 31210646431 in words is "thirty-one billion, two hundred ten million, six hundred forty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •