Base | Representation |
---|---|
bin | 11111000011101010110… |
… | …010111111000101000101 |
3 | 21120000212001202111010001 |
4 | 133003222302333011011 |
5 | 234431412202403213 |
6 | 4312242510401301 |
7 | 310123350200353 |
oct | 37035262770505 |
9 | 7500761674101 |
10 | 2134243012933 |
11 | 7531445a5379 |
12 | 2a5769800231 |
13 | 1263484c4935 |
14 | 7542568a7d3 |
15 | 3a7b35ba1dd |
hex | 1f0eacbf145 |
2134243012933 has 2 divisors, whose sum is σ = 2134243012934. Its totient is φ = 2134243012932.
The previous prime is 2134243012883. The next prime is 2134243012969. The reversal of 2134243012933 is 3392103424312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1396667785249 + 737575227684 = 1181807^2 + 858822^2 .
It is a cyclic number.
It is not a de Polignac number, because 2134243012933 - 229 = 2133706142021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2134243012892 and 2134243012901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2134243019933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1067121506466 + 1067121506467.
It is an arithmetic number, because the mean of its divisors is an integer number (1067121506467).
Almost surely, 22134243012933 is an apocalyptic number.
It is an amenable number.
2134243012933 is a deficient number, since it is larger than the sum of its proper divisors (1).
2134243012933 is an equidigital number, since it uses as much as digits as its factorization.
2134243012933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 37.
The spelling of 2134243012933 in words is "two trillion, one hundred thirty-four billion, two hundred forty-three million, twelve thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.795 sec. • engine limits •