Base | Representation |
---|---|
bin | 1100110101111101111… |
… | …1110001011010000101 |
3 | 210002112011102120102012 |
4 | 3031133133301122011 |
5 | 12103340221341303 |
6 | 245210234424005 |
7 | 21640541526524 |
oct | 3153737613205 |
9 | 702464376365 |
10 | 220645496453 |
11 | 856366a3268 |
12 | 36919892005 |
13 | 17a64661c75 |
14 | a971dd44bb |
15 | 5b15be85d8 |
hex | 335f7f1685 |
220645496453 has 4 divisors (see below), whose sum is σ = 222256047660. Its totient is φ = 219034945248.
The previous prime is 220645496447. The next prime is 220645496483. The reversal of 220645496453 is 354694546022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 106724395969 + 113921100484 = 326687^2 + 337522^2 .
It is a cyclic number.
It is not a de Polignac number, because 220645496453 - 24 = 220645496437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220645496413) 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, 805275398 + ... + 805275671.
It is an arithmetic number, because the mean of its divisors is an integer number (55564011915).
Almost surely, 2220645496453 is an apocalyptic number.
It is an amenable number.
220645496453 is a deficient number, since it is larger than the sum of its proper divisors (1610551207).
220645496453 is a wasteful number, since it uses less digits than its factorization.
220645496453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1610551206.
The product of its (nonzero) digits is 6220800, while the sum is 50.
The spelling of 220645496453 in words is "two hundred twenty billion, six hundred forty-five million, four hundred ninety-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •