Base | Representation |
---|---|
bin | 10010110111010011… |
… | …000101011001101101 |
3 | 1221021121112211012012 |
4 | 102313103011121231 |
5 | 312440301240243 |
6 | 13145521051005 |
7 | 1314640350116 |
oct | 226723053155 |
9 | 57247484165 |
10 | 20255102573 |
11 | 86545283a2 |
12 | 3b13486a65 |
13 | 1baa4b59c4 |
14 | da212d20d |
15 | 7d835bd18 |
hex | 4b74c566d |
20255102573 has 4 divisors (see below), whose sum is σ = 20261429568. Its totient is φ = 20248775580.
The previous prime is 20255102429. The next prime is 20255102597. The reversal of 20255102573 is 37520155202.
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 20255102573 - 218 = 20254840429 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20255102173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3158693 + ... + 3165098.
It is an arithmetic number, because the mean of its divisors is an integer number (5065357392).
Almost surely, 220255102573 is an apocalyptic number.
It is an amenable number.
20255102573 is a deficient number, since it is larger than the sum of its proper divisors (6326995).
20255102573 is an equidigital number, since it uses as much as digits as its factorization.
20255102573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6326994.
The product of its (nonzero) digits is 21000, while the sum is 32.
Adding to 20255102573 its reverse (37520155202), we get a palindrome (57775257775).
The spelling of 20255102573 in words is "twenty billion, two hundred fifty-five million, one hundred two thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •