Base | Representation |
---|---|
bin | 101101011010101100100… |
… | …111001100100100000111 |
3 | 102001100221210112210120202 |
4 | 231122230213030210013 |
5 | 402113343301310002 |
6 | 10345441554121115 |
7 | 441326223043526 |
oct | 55325447144407 |
9 | 12040853483522 |
10 | 3121042213127 |
11 | aa3698a66a63 |
12 | 424a6688019b |
13 | 19840b914417 |
14 | ab0b88184bd |
15 | 562bae68502 |
hex | 2d6ac9cc907 |
3121042213127 has 2 divisors, whose sum is σ = 3121042213128. Its totient is φ = 3121042213126.
The previous prime is 3121042213109. The next prime is 3121042213147. The reversal of 3121042213127 is 7213122401213.
It is a happy number.
3121042213127 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3121042213127 - 224 = 3121025435911 is a prime.
It is a super-2 number, since 2×31210422131272 (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 3121042213127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3121042213147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560521106563 + 1560521106564.
It is an arithmetic number, because the mean of its divisors is an integer number (1560521106564).
Almost surely, 23121042213127 is an apocalyptic number.
3121042213127 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121042213127 is an equidigital number, since it uses as much as digits as its factorization.
3121042213127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 29.
The spelling of 3121042213127 in words is "three trillion, one hundred twenty-one billion, forty-two million, two hundred thirteen thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •