Base | Representation |
---|---|
bin | 1100111000100001001… |
… | …0111100110110110100 |
3 | 210011021212110000120202 |
4 | 3032020102330312310 |
5 | 12111240440020312 |
6 | 245402210020032 |
7 | 21663522653546 |
oct | 3161022746664 |
9 | 704255400522 |
10 | 221330001332 |
11 | 85958019980 |
12 | 36a8ab77618 |
13 | 17b4340753b |
14 | a9d8c97696 |
15 | 5b55d599c2 |
hex | 33884bcdb4 |
221330001332 has 48 divisors (see below), whose sum is σ = 426230310912. Its totient is φ = 99727044480.
The previous prime is 221330001329. The next prime is 221330001337. The reversal of 221330001332 is 233100033122.
221330001332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221330001337) 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 15 ways as a sum of consecutive naturals, for example, 6761918 + ... + 6794570.
It is an arithmetic number, because the mean of its divisors is an integer number (8879798144).
Almost surely, 2221330001332 is an apocalyptic number.
221330001332 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
221330001332 is a deficient number, since it is larger than the sum of its proper divisors (204900309580).
221330001332 is a wasteful number, since it uses less digits than its factorization.
221330001332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34008 (or 34006 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 221330001332 its reverse (233100033122), we get a palindrome (454430034454).
The spelling of 221330001332 in words is "two hundred twenty-one billion, three hundred thirty million, one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •