Base | Representation |
---|---|
bin | 1001010110001011000011… |
… | …11010100110011110001011 |
3 | 2200202212001011210200020020 |
4 | 10223011201322212132023 |
5 | 10143220132140410433 |
6 | 111413540200231523 |
7 | 4220624006134605 |
oct | 453054172463613 |
9 | 80685034720206 |
10 | 20553061263243 |
11 | 66045602a1a03 |
12 | 237b3a276b5a3 |
13 | b611b74859a2 |
14 | 510ab85a4175 |
15 | 259973ea4cb3 |
hex | 12b161ea678b |
20553061263243 has 16 divisors (see below), whose sum is σ = 27439645600800. Its totient is φ = 13684269674240.
The previous prime is 20553061263197. The next prime is 20553061263281. The reversal of 20553061263243 is 34236216035502.
It is a cyclic number.
It is not a de Polignac number, because 20553061263243 - 217 = 20553061132171 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20553061263195 and 20553061263204.
It is not an unprimeable number, because it can be changed into a prime (20553061223243) 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 15 ways as a sum of consecutive naturals, for example, 6281263 + ... + 8975543.
It is an arithmetic number, because the mean of its divisors is an integer number (1714977850050).
Almost surely, 220553061263243 is an apocalyptic number.
20553061263243 is a deficient number, since it is larger than the sum of its proper divisors (6886584337557).
20553061263243 is a wasteful number, since it uses less digits than its factorization.
20553061263243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2697582.
The product of its (nonzero) digits is 777600, while the sum is 42.
Adding to 20553061263243 its reverse (34236216035502), we get a palindrome (54789277298745).
The spelling of 20553061263243 in words is "twenty trillion, five hundred fifty-three billion, sixty-one million, two hundred sixty-three thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •