Base | Representation |
---|---|
bin | 1100110111010101101… |
… | …0110111111011110111 |
3 | 210010110210112111102110 |
4 | 3031311122313323313 |
5 | 12110113401424343 |
6 | 245310534142103 |
7 | 21652626102015 |
oct | 3156532677367 |
9 | 703423474373 |
10 | 221013311223 |
11 | 85805285a11 |
12 | 36a00ab1933 |
13 | 17ac2914a43 |
14 | a9a8bbb8b5 |
15 | 5b38150833 |
hex | 33756b7ef7 |
221013311223 has 8 divisors (see below), whose sum is σ = 307496780928. Its totient is φ = 140936024504.
The previous prime is 221013311191. The next prime is 221013311231. The reversal of 221013311223 is 322113310122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 221013311223 - 25 = 221013311191 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 221013311223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221013311023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1601545665 + ... + 1601545802.
It is an arithmetic number, because the mean of its divisors is an integer number (38437097616).
Almost surely, 2221013311223 is an apocalyptic number.
221013311223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
221013311223 is a deficient number, since it is larger than the sum of its proper divisors (86483469705).
221013311223 is a wasteful number, since it uses less digits than its factorization.
221013311223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3203091493.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 221013311223 its reverse (322113310122), we get a palindrome (543126621345).
The spelling of 221013311223 in words is "two hundred twenty-one billion, thirteen million, three hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •