Base | Representation |
---|---|
bin | 1100111000100001011… |
… | …1100100000001011011 |
3 | 210011021221201110000111 |
4 | 3032020113210001123 |
5 | 12111241242212311 |
6 | 245402251545151 |
7 | 21663536150410 |
oct | 3161027440133 |
9 | 704257643014 |
10 | 221331210331 |
11 | 85958775250 |
12 | 36a8b45b1b7 |
13 | 17b4373b91a |
14 | a9d90d0107 |
15 | 5b55ee7d21 |
hex | 33885e405b |
221331210331 has 8 divisors (see below), whose sum is σ = 275945405184. Its totient is φ = 172465878120.
The previous prime is 221331210319. The next prime is 221331210341. The reversal of 221331210331 is 133012133122.
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 221331210331 - 219 = 221330686043 is a prime.
It is a super-2 number, since 2×2213312103312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221331210341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1437215575 + ... + 1437215728.
It is an arithmetic number, because the mean of its divisors is an integer number (34493175648).
Almost surely, 2221331210331 is an apocalyptic number.
221331210331 is a deficient number, since it is larger than the sum of its proper divisors (54614194853).
221331210331 is a wasteful number, since it uses less digits than its factorization.
221331210331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2874431321.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 221331210331 its reverse (133012133122), we get a palindrome (354343343453).
The spelling of 221331210331 in words is "two hundred twenty-one billion, three hundred thirty-one million, two hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •