Base | Representation |
---|---|
bin | 10010110101010001… |
… | …111110001001010001 |
3 | 1221012020212020210112 |
4 | 102311101332021101 |
5 | 312403120200043 |
6 | 13142311411105 |
7 | 1314046561631 |
oct | 226521761121 |
9 | 57166766715 |
10 | 20221256273 |
11 | 8637410149 |
12 | 3b04083a95 |
13 | 1ba34950ca |
14 | d9b83c6c1 |
15 | 7d53c3518 |
hex | 4b547e251 |
20221256273 has 8 divisors (see below), whose sum is σ = 20277659880. Its totient is φ = 20164883200.
The previous prime is 20221256249. The next prime is 20221256291. The reversal of 20221256273 is 37265212202.
It can be written as a sum of positive squares in 4 ways, for example, as 18504977089 + 1716279184 = 136033^2 + 41428^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20221256273 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20221256773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2095223 + ... + 2104851.
It is an arithmetic number, because the mean of its divisors is an integer number (2534707485).
Almost surely, 220221256273 is an apocalyptic number.
It is an amenable number.
20221256273 is a deficient number, since it is larger than the sum of its proper divisors (56403607).
20221256273 is an equidigital number, since it uses as much as digits as its factorization.
20221256273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15267.
The product of its (nonzero) digits is 20160, while the sum is 32.
Adding to 20221256273 its reverse (37265212202), we get a palindrome (57486468475).
The spelling of 20221256273 in words is "twenty billion, two hundred twenty-one million, two hundred fifty-six thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •