Base | Representation |
---|---|
bin | 1100010010110010010… |
… | …1000100001001100011 |
3 | 202012010222112020222001 |
4 | 3010230211010021203 |
5 | 11430020013430311 |
6 | 241005145024431 |
7 | 21154523345233 |
oct | 3045445041143 |
9 | 665128466861 |
10 | 211201311331 |
11 | 8162a6a819a |
12 | 34b22a85117 |
13 | 16bbab6c94a |
14 | a3179d5cc3 |
15 | 5761a2b4c1 |
hex | 312c944263 |
211201311331 has 8 divisors (see below), whose sum is σ = 219931034400. Its totient is φ = 202568049600.
The previous prime is 211201311323. The next prime is 211201311397. The reversal of 211201311331 is 133113102112.
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 211201311331 - 23 = 211201311323 is a prime.
It is a super-2 number, since 2×2112013113312 (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 = 211201311299 and 211201311308.
It is not an unprimeable number, because it can be changed into a prime (211201311301) 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, 24110866 + ... + 24119623.
It is an arithmetic number, because the mean of its divisors is an integer number (27491379300).
Almost surely, 2211201311331 is an apocalyptic number.
211201311331 is a deficient number, since it is larger than the sum of its proper divisors (8729723069).
211201311331 is a wasteful number, since it uses less digits than its factorization.
211201311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48230669.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 211201311331 its reverse (133113102112), we get a palindrome (344314413443).
The spelling of 211201311331 in words is "two hundred eleven billion, two hundred one million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •