Base | Representation |
---|---|
bin | 1100010010110111100… |
… | …0111111101010000111 |
3 | 202012012111221001121211 |
4 | 3010231320333222013 |
5 | 11430041132004111 |
6 | 241011252352251 |
7 | 21155211352153 |
oct | 3045570775207 |
9 | 665174831554 |
10 | 211223313031 |
11 | 81641065415 |
12 | 34b2a315687 |
13 | 16bc25a41c3 |
14 | a31a8c2063 |
15 | 5763925521 |
hex | 312de3fa87 |
211223313031 has 8 divisors (see below), whose sum is σ = 215385659424. Its totient is φ = 207101575200.
The previous prime is 211223312957. The next prime is 211223313071. The reversal of 211223313031 is 130313322112.
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 211223313031 - 219 = 211222788743 is a prime.
It is a super-2 number, since 2×2112233130312 (a number of 23 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 = 211223312993 and 211223313011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211223313071) 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, 10141636 + ... + 10162441.
It is an arithmetic number, because the mean of its divisors is an integer number (26923207428).
Almost surely, 2211223313031 is an apocalyptic number.
211223313031 is a deficient number, since it is larger than the sum of its proper divisors (4162346393).
211223313031 is a wasteful number, since it uses less digits than its factorization.
211223313031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20304281.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 211223313031 its reverse (130313322112), we get a palindrome (341536635143).
The spelling of 211223313031 in words is "two hundred eleven billion, two hundred twenty-three million, three hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •