Base | Representation |
---|---|
bin | 11110110111100111010… |
… | …101011011011100000101 |
3 | 21111210110001020220001121 |
4 | 132313213111123130011 |
5 | 234223410301444422 |
6 | 4302302313353541 |
7 | 306154535521012 |
oct | 36674725333405 |
9 | 7453401226047 |
10 | 2121300031237 |
11 | 748702624692 |
12 | 2a31571088b1 |
13 | 125064b9799a |
14 | 74958724709 |
15 | 3a2a717c8c7 |
hex | 1ede755b705 |
2121300031237 has 2 divisors, whose sum is σ = 2121300031238. Its totient is φ = 2121300031236.
The previous prime is 2121300031139. The next prime is 2121300031241. The reversal of 2121300031237 is 7321300031212.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1403689431076 + 717610600161 = 1184774^2 + 847119^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2121300031237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2121300031267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060650015618 + 1060650015619.
It is an arithmetic number, because the mean of its divisors is an integer number (1060650015619).
Almost surely, 22121300031237 is an apocalyptic number.
It is an amenable number.
2121300031237 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121300031237 is an equidigital number, since it uses as much as digits as its factorization.
2121300031237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 25.
Subtracting from 2121300031237 its sum of digits (25), we obtain a palindrome (2121300031212).
Adding to 2121300031237 its reverse (7321300031212), we get a palindrome (9442600062449).
The spelling of 2121300031237 in words is "two trillion, one hundred twenty-one billion, three hundred million, thirty-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •