Base | Representation |
---|---|
bin | 1001010110000111101… |
… | …01011011000000111111 |
3 | 1010200211221000201210211 |
4 | 10223003311123000333 |
5 | 20230114431010221 |
6 | 403303425013251 |
7 | 32125324444234 |
oct | 4530365330077 |
9 | 1120757021724 |
10 | 321113141311 |
11 | 114201aa6916 |
12 | 52298184227 |
13 | 24386008831 |
14 | 117831c778b |
15 | 85460096e1 |
hex | 4ac3d5b03f |
321113141311 has 4 divisors (see below), whose sum is σ = 321114279592. Its totient is φ = 321112003032.
The previous prime is 321113141269. The next prime is 321113141341. The reversal of 321113141311 is 113141311123.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 321113141311 - 215 = 321113108543 is a prime.
It is a super-3 number, since 3×3211131413113 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321113141341) 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, 205096 + ... + 827218.
It is an arithmetic number, because the mean of its divisors is an integer number (80278569898).
Almost surely, 2321113141311 is an apocalyptic number.
321113141311 is a deficient number, since it is larger than the sum of its proper divisors (1138281).
321113141311 is an equidigital number, since it uses as much as digits as its factorization.
321113141311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1138280.
The product of its digits is 216, while the sum is 22.
Adding to 321113141311 its reverse (113141311123), we get a palindrome (434254452434).
The spelling of 321113141311 in words is "three hundred twenty-one billion, one hundred thirteen million, one hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •