Base | Representation |
---|---|
bin | 11101110111101010101… |
… | …010010110100101001001 |
3 | 21021020012202110120002102 |
4 | 131313222222112211021 |
5 | 232112244402340043 |
6 | 4210545041043145 |
7 | 301204146164315 |
oct | 35675252264511 |
9 | 7236182416072 |
10 | 2052636371273 |
11 | 7215777a0674 |
12 | 2919939264b5 |
13 | 11b74156cca7 |
14 | 714c33acb45 |
15 | 385d90396b8 |
hex | 1ddeaa96949 |
2052636371273 has 4 divisors (see below), whose sum is σ = 2052639237648. Its totient is φ = 2052633504900.
The previous prime is 2052636371267. The next prime is 2052636371281. The reversal of 2052636371273 is 3721736362502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2052636371273 - 24 = 2052636371257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2052636371213) 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 in 3 ways as a sum of consecutive naturals, for example, 660698 + ... + 2131148.
It is an arithmetic number, because the mean of its divisors is an integer number (513159809412).
Almost surely, 22052636371273 is an apocalyptic number.
It is an amenable number.
2052636371273 is a deficient number, since it is larger than the sum of its proper divisors (2866375).
2052636371273 is a wasteful number, since it uses less digits than its factorization.
2052636371273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2866374.
The product of its (nonzero) digits is 1905120, while the sum is 47.
The spelling of 2052636371273 in words is "two trillion, fifty-two billion, six hundred thirty-six million, three hundred seventy-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •