Base | Representation |
---|---|
bin | 1100010011100011001… |
… | …0000000101100001111 |
3 | 202012200020202010102101 |
4 | 3010320302000230033 |
5 | 11430424421003011 |
6 | 241041340535531 |
7 | 21162560422354 |
oct | 3047062005417 |
9 | 665606663371 |
10 | 211406031631 |
11 | 81725214623 |
12 | 34b7b5515a7 |
13 | 16c213ba612 |
14 | a336c8662b |
15 | 57749b92c1 |
hex | 3138c80b0f |
211406031631 has 8 divisors (see below), whose sum is σ = 217552161024. Its totient is φ = 205328574360.
The previous prime is 211406031607. The next prime is 211406031649. The reversal of 211406031631 is 136130604112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211406031631 - 231 = 209258547983 is a prime.
It is a super-2 number, since 2×2114060316312 (a number of 23 digits) contains 22 as substring.
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 211406031631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211406031671) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17161785 + ... + 17174098.
It is an arithmetic number, because the mean of its divisors is an integer number (27194020128).
Almost surely, 2211406031631 is an apocalyptic number.
211406031631 is a deficient number, since it is larger than the sum of its proper divisors (6146129393).
211406031631 is a wasteful number, since it uses less digits than its factorization.
211406031631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34336061.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 211406031631 its reverse (136130604112), we get a palindrome (347536635743).
The spelling of 211406031631 in words is "two hundred eleven billion, four hundred six million, thirty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •