Base | Representation |
---|---|
bin | 1100111000101001100… |
… | …1010010010010111011 |
3 | 210011101022201010122010 |
4 | 3032022121102102323 |
5 | 12111323443411233 |
6 | 245405504501003 |
7 | 21664431202530 |
oct | 3161231222273 |
9 | 704338633563 |
10 | 221365216443 |
11 | 85975991578 |
12 | 36a9a91a763 |
13 | 17b4a7b7197 |
14 | a9dd822d87 |
15 | 5b58eb3b63 |
hex | 338a6524bb |
221365216443 has 8 divisors (see below), whose sum is σ = 337318425088. Its totient is φ = 126494409384.
The previous prime is 221365216399. The next prime is 221365216453. The reversal of 221365216443 is 344612563122.
221365216443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221365216443 - 29 = 221365215931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221365216453) 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 7 ways as a sum of consecutive naturals, for example, 5270600371 + ... + 5270600412.
It is an arithmetic number, because the mean of its divisors is an integer number (42164803136).
Almost surely, 2221365216443 is an apocalyptic number.
221365216443 is a deficient number, since it is larger than the sum of its proper divisors (115953208645).
221365216443 is a wasteful number, since it uses less digits than its factorization.
221365216443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10541200793.
The product of its digits is 207360, while the sum is 39.
Adding to 221365216443 its reverse (344612563122), we get a palindrome (565977779565).
The spelling of 221365216443 in words is "two hundred twenty-one billion, three hundred sixty-five million, two hundred sixteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •