Base | Representation |
---|---|
bin | 100100100001001011110001… |
… | …0100111111100000100001111 |
3 | 1120010100100020211221002021121 |
4 | 1021002113202213330010033 |
5 | 314100332241433033012 |
6 | 3055102252032141411 |
7 | 124442246543000305 |
oct | 11102274247740417 |
9 | 1503310224832247 |
10 | 321220111221007 |
11 | 93394758658659 |
12 | 3003a739397867 |
13 | 10a30c0772020b |
14 | 59471ca176275 |
15 | 2720a13cbaa07 |
hex | 12425e29fc10f |
321220111221007 has 2 divisors, whose sum is σ = 321220111221008. Its totient is φ = 321220111221006.
The previous prime is 321220111220893. The next prime is 321220111221043. The reversal of 321220111221007 is 700122111022123.
It is a strong prime.
It is an emirp because it is prime and its reverse (700122111022123) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-321220111221007 is a prime.
It is a super-2 number, since 2×3212201112210072 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321220111231007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160610055610503 + 160610055610504.
It is an arithmetic number, because the mean of its divisors is an integer number (160610055610504).
Almost surely, 2321220111221007 is an apocalyptic number.
321220111221007 is a deficient number, since it is larger than the sum of its proper divisors (1).
321220111221007 is an equidigital number, since it uses as much as digits as its factorization.
321220111221007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 25.
The spelling of 321220111221007 in words is "three hundred twenty-one trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty-one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •