Base | Representation |
---|---|
bin | 1001010110011101111… |
… | …11011101001101101011 |
3 | 1010201022222020110020202 |
4 | 10223032333131031223 |
5 | 20231010340234011 |
6 | 403334152542415 |
7 | 32133056445056 |
oct | 4531677351553 |
9 | 1121288213222 |
10 | 321300321131 |
11 | 114298722889 |
12 | 5232a9b1a0b |
13 | 243b5a2471a |
14 | 1179ddcda9d |
15 | 855768023b |
hex | 4acefdd36b |
321300321131 has 4 divisors (see below), whose sum is σ = 329984113632. Its totient is φ = 312616528632.
The previous prime is 321300321103. The next prime is 321300321137. The reversal of 321300321131 is 131123003123.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131123003123 = 7 ⋅18731857589.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-321300321131 is a prime.
It is a super-2 number, since 2×3213003211312 (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 (321300321137) 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, 4341896195 + ... + 4341896268.
It is an arithmetic number, because the mean of its divisors is an integer number (82496028408).
Almost surely, 2321300321131 is an apocalyptic number.
321300321131 is a deficient number, since it is larger than the sum of its proper divisors (8683792501).
321300321131 is an equidigital number, since it uses as much as digits as its factorization.
321300321131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8683792500.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 321300321131 its reverse (131123003123), we get a palindrome (452423324254).
The spelling of 321300321131 in words is "three hundred twenty-one billion, three hundred million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •