Base | Representation |
---|---|
bin | 1001010110001000101… |
… | …00100101100100000101 |
3 | 1010200212111101210111012 |
4 | 10223010110211210011 |
5 | 20230124023422411 |
6 | 403304320052005 |
7 | 32125454051432 |
oct | 4530424454405 |
9 | 1120774353435 |
10 | 321121310981 |
11 | 114206676909 |
12 | 5229aa64005 |
13 | 24387909263 |
14 | 11784312b89 |
15 | 8546ac018b |
hex | 4ac4525905 |
321121310981 has 2 divisors, whose sum is σ = 321121310982. Its totient is φ = 321121310980.
The previous prime is 321121310953. The next prime is 321121311047. The reversal of 321121310981 is 189013121123.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 241433666881 + 79687644100 = 491359^2 + 282290^2 .
It is an emirp because it is prime and its reverse (189013121123) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-321121310981 is a prime.
It is a super-2 number, since 2×3211213109812 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321121310911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160560655490 + 160560655491.
It is an arithmetic number, because the mean of its divisors is an integer number (160560655491).
Almost surely, 2321121310981 is an apocalyptic number.
It is an amenable number.
321121310981 is a deficient number, since it is larger than the sum of its proper divisors (1).
321121310981 is an equidigital number, since it uses as much as digits as its factorization.
321121310981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 32.
The spelling of 321121310981 in words is "three hundred twenty-one billion, one hundred twenty-one million, three hundred ten thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •