Base | Representation |
---|---|
bin | 1001010100111011010100… |
… | …10111100100001001010101 |
3 | 2200121202112211020221101022 |
4 | 10222131222113210021111 |
5 | 10142014444332310121 |
6 | 111342140315210525 |
7 | 4214550125250533 |
oct | 452355227441125 |
9 | 80552484227338 |
10 | 20510253400661 |
11 | 6598393386182 |
12 | 2373036446a45 |
13 | b5a15478249b |
14 | 50c9b7127153 |
15 | 2587bac2daab |
hex | 12a76a5e4255 |
20510253400661 has 4 divisors (see below), whose sum is σ = 20510668713024. Its totient is φ = 20509838088300.
The previous prime is 20510253400631. The next prime is 20510253400753. The reversal of 20510253400661 is 16600435201502.
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.
It is a cyclic number.
It is not a de Polignac number, because 20510253400661 - 210 = 20510253399637 is a prime.
It is a super-2 number, since 2×205102534006612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20510253400621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 207582095 + ... + 207680876.
It is an arithmetic number, because the mean of its divisors is an integer number (5127667178256).
Almost surely, 220510253400661 is an apocalyptic number.
It is an amenable number.
20510253400661 is a deficient number, since it is larger than the sum of its proper divisors (415312363).
20510253400661 is an equidigital number, since it uses as much as digits as its factorization.
20510253400661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 415312362.
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 20510253400661 in words is "twenty trillion, five hundred ten billion, two hundred fifty-three million, four hundred thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •