Base | Representation |
---|---|
bin | 1001010110000111011… |
… | …10000100000001010001 |
3 | 1010200211210101201110001 |
4 | 10223003232010001101 |
5 | 20230113432241423 |
6 | 403303315410001 |
7 | 32125302160606 |
oct | 4530356040121 |
9 | 1120753351401 |
10 | 321111212113 |
11 | 1142009a943a |
12 | 522975b3901 |
13 | 243857b16b3 |
14 | 11782c446ad |
15 | 8545c77cad |
hex | 4ac3b84051 |
321111212113 has 4 divisors (see below), whose sum is σ = 321417324900. Its totient is φ = 320805099328.
The previous prime is 321111212063. The next prime is 321111212143. The reversal of 321111212113 is 311212111123.
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 238863855169 + 82247356944 = 488737^2 + 286788^2 .
It is a cyclic number.
It is not a de Polignac number, because 321111212113 - 29 = 321111211601 is a prime.
It is a super-2 number, since 2×3211112121132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321111212143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153054820 + ... + 153056917.
It is an arithmetic number, because the mean of its divisors is an integer number (80354331225).
Almost surely, 2321111212113 is an apocalyptic number.
It is an amenable number.
321111212113 is a deficient number, since it is larger than the sum of its proper divisors (306112787).
321111212113 is a wasteful number, since it uses less digits than its factorization.
321111212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306112786.
The product of its digits is 72, while the sum is 19.
Adding to 321111212113 its reverse (311212111123), we get a palindrome (632323323236).
The spelling of 321111212113 in words is "three hundred twenty-one billion, one hundred eleven million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •