Base | Representation |
---|---|
bin | 101101011010111100001… |
… | …101111100111111111011 |
3 | 102001101122001012112111102 |
4 | 231122330031330333323 |
5 | 402114412312444402 |
6 | 10345523545522015 |
7 | 441335552336564 |
oct | 55327415747773 |
9 | 12041561175442 |
10 | 3121304031227 |
11 | aa3812831858 |
12 | 424b1a4a330b |
13 | 198450c34085 |
14 | ab1014cd16b |
15 | 562d3e34102 |
hex | 2d6bc37cffb |
3121304031227 has 2 divisors, whose sum is σ = 3121304031228. Its totient is φ = 3121304031226.
The previous prime is 3121304031173. The next prime is 3121304031233. The reversal of 3121304031227 is 7221304031213.
It is a strong prime.
It is an emirp because it is prime and its reverse (7221304031213) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3121304031227 is a prime.
It is a super-2 number, since 2×31213040312272 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3121304031227.
It is not a weakly prime, because it can be changed into another prime (3121304037227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560652015613 + 1560652015614.
It is an arithmetic number, because the mean of its divisors is an integer number (1560652015614).
Almost surely, 23121304031227 is an apocalyptic number.
3121304031227 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121304031227 is an equidigital number, since it uses as much as digits as its factorization.
3121304031227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
The spelling of 3121304031227 in words is "three trillion, one hundred twenty-one billion, three hundred four million, thirty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •