Base | Representation |
---|---|
bin | 1100110111000110101… |
… | …0011000111101001000 |
3 | 210010022101220122210202 |
4 | 3031301222120331020 |
5 | 12110001232113033 |
6 | 245300403031332 |
7 | 21651232206464 |
oct | 3156152307510 |
9 | 703271818722 |
10 | 220950269768 |
11 | 85782737a38 |
12 | 369a396b548 |
13 | 17ab28415c7 |
14 | a9a068b4a4 |
15 | 5b3284b8e8 |
hex | 3371a98f48 |
220950269768 has 12 divisors (see below), whose sum is σ = 414284248665. Its totient is φ = 110474470128.
The previous prime is 220950269759. The next prime is 220950269791. The reversal of 220950269768 is 867962059022.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
220950269768 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 211156792324 + 9793477444 = 459518^2 + 98962^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=332378.
It is a Duffinian number.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 1246418 + ... + 1412606.
Almost surely, 2220950269768 is an apocalyptic number.
It is an amenable number.
220950269768 is a deficient number, since it is larger than the sum of its proper divisors (193333978897).
220950269768 is an frugal number, since it uses more digits than its factorization.
220950269768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332384 (or 166191 counting only the distinct ones).
The product of its (nonzero) digits is 6531840, while the sum is 56.
The spelling of 220950269768 in words is "two hundred twenty billion, nine hundred fifty million, two hundred sixty-nine thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •