Base | Representation |
---|---|
bin | 11110110111101001110… |
… | …010011111001111101001 |
3 | 21111210112220201122200202 |
4 | 132313221302133033221 |
5 | 234224001322002213 |
6 | 4302310344041545 |
7 | 306155545500404 |
oct | 36675162371751 |
9 | 7453486648622 |
10 | 2121341203433 |
11 | 7487238959a1 |
12 | 2a3168a632b5 |
13 | 125070581c2a |
14 | 7495dda0d3b |
15 | 3a2aaab1b58 |
hex | 1ede9c9f3e9 |
2121341203433 has 2 divisors, whose sum is σ = 2121341203434. Its totient is φ = 2121341203432.
The previous prime is 2121341203417. The next prime is 2121341203453. The reversal of 2121341203433 is 3343021431212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1752756222889 + 368584980544 = 1323917^2 + 607112^2 .
It is a cyclic number.
It is not a de Polignac number, because 2121341203433 - 24 = 2121341203417 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2121341203396 and 2121341203405.
It is not a weakly prime, because it can be changed into another prime (2121341203453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060670601716 + 1060670601717.
It is an arithmetic number, because the mean of its divisors is an integer number (1060670601717).
Almost surely, 22121341203433 is an apocalyptic number.
It is an amenable number.
2121341203433 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121341203433 is an equidigital number, since it uses as much as digits as its factorization.
2121341203433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 2121341203433 its reverse (3343021431212), we get a palindrome (5464362634645).
The spelling of 2121341203433 in words is "two trillion, one hundred twenty-one billion, three hundred forty-one million, two hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •