Base | Representation |
---|---|
bin | 1100110101111101001… |
… | …0001010110110001000 |
3 | 210002111220201102000202 |
4 | 3031133102022312020 |
5 | 12103333313240012 |
6 | 245210030151332 |
7 | 21640466315534 |
oct | 3153722126610 |
9 | 702456642022 |
10 | 220641930632 |
11 | 85634688202 |
12 | 36918652548 |
13 | 17a639b3c06 |
14 | a971746bc4 |
15 | 5b15741cc2 |
hex | 335f48ad88 |
220641930632 has 36 divisors (see below), whose sum is σ = 439515618255. Its totient is φ = 103820868096.
The previous prime is 220641930539. The next prime is 220641930763. The reversal of 220641930632 is 236039146022.
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.
220641930632 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 5 ways, for example, as 139841594116 + 80800336516 = 373954^2 + 284254^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=332146.
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 8 ways as a sum of consecutive naturals, for example, 22581044 + ... + 22590812.
Almost surely, 2220641930632 is an apocalyptic number.
It is an amenable number.
220641930632 is a deficient number, since it is larger than the sum of its proper divisors (218873687623).
220641930632 is an frugal number, since it uses more digits than its factorization.
220641930632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19578 (or 9788 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 38.
The spelling of 220641930632 in words is "two hundred twenty billion, six hundred forty-one million, nine hundred thirty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •