Base | Representation |
---|---|
bin | 11110110111100010000… |
… | …010100110101000001001 |
3 | 21111210012212010022120101 |
4 | 132313202002212220021 |
5 | 234223220032211444 |
6 | 4302245421525401 |
7 | 306152406535465 |
oct | 36674202465011 |
9 | 7453185108511 |
10 | 2121211210249 |
11 | 74866747910a |
12 | 2a3131413861 |
13 | 12504c6695a1 |
14 | 7494aa034a5 |
15 | 3a29e4853d4 |
hex | 1ede20a6a09 |
2121211210249 has 2 divisors, whose sum is σ = 2121211210250. Its totient is φ = 2121211210248.
The previous prime is 2121211210213. The next prime is 2121211210277. The reversal of 2121211210249 is 9420121121212.
It is an a-pointer prime, because the next prime (2121211210277) can be obtained adding 2121211210249 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1953934300224 + 167276910025 = 1397832^2 + 408995^2 .
It is a cyclic number.
It is not a de Polignac number, because 2121211210249 - 29 = 2121211209737 is a prime.
It is not a weakly prime, because it can be changed into another prime (2121211210849) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060605605124 + 1060605605125.
It is an arithmetic number, because the mean of its divisors is an integer number (1060605605125).
Almost surely, 22121211210249 is an apocalyptic number.
It is an amenable number.
2121211210249 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121211210249 is an equidigital number, since it uses as much as digits as its factorization.
2121211210249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
The spelling of 2121211210249 in words is "two trillion, one hundred twenty-one billion, two hundred eleven million, two hundred ten thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •