Base | Representation |
---|---|
bin | 1100111000011110110… |
… | …0111010100000010111 |
3 | 210011021011200102210201 |
4 | 3032013230322200113 |
5 | 12111230411431411 |
6 | 245401212201331 |
7 | 21663342134356 |
oct | 3160754724027 |
9 | 704234612721 |
10 | 221320030231 |
11 | 859524294a3 |
12 | 36a87769247 |
13 | 17b41325b91 |
14 | a9d781d99d |
15 | 5b5503a3c1 |
hex | 3387b3a817 |
221320030231 has 4 divisors (see below), whose sum is σ = 225495879912. Its totient is φ = 217144180552.
The previous prime is 221320030223. The next prime is 221320030313. The reversal of 221320030231 is 132030023122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 221320030231 - 23 = 221320030223 is a prime.
It is a super-2 number, since 2×2213200302312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221320030199 and 221320030208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221320030031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2087924761 + ... + 2087924866.
It is an arithmetic number, because the mean of its divisors is an integer number (56373969978).
Almost surely, 2221320030231 is an apocalyptic number.
221320030231 is a deficient number, since it is larger than the sum of its proper divisors (4175849681).
221320030231 is an equidigital number, since it uses as much as digits as its factorization.
221320030231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4175849680.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 221320030231 its reverse (132030023122), we get a palindrome (353350053353).
The spelling of 221320030231 in words is "two hundred twenty-one billion, three hundred twenty million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •