Base | Representation |
---|---|
bin | 110010010001111000100110… |
… | …100011110001010110001110 |
3 | 1001222221221121210221101220002 |
4 | 302101320212203301112032 |
5 | 212441003432234110410 |
6 | 2102150155414324302 |
7 | 64402132402206341 |
oct | 6221704643612616 |
9 | 1058857553841802 |
10 | 221131333113230 |
11 | 645062a972a081 |
12 | 20974898059692 |
13 | 9650797972c67 |
14 | 3c86b56854458 |
15 | 1a872005817a5 |
hex | c91e268f158e |
221131333113230 has 8 divisors (see below), whose sum is σ = 398036399603832. Its totient is φ = 88452533245288.
The previous prime is 221131333113203. The next prime is 221131333113319. The reversal of 221131333113230 is 32311333131122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 221131333113193 and 221131333113202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11056566655652 + ... + 11056566655671.
It is an arithmetic number, because the mean of its divisors is an integer number (49754549950479).
Almost surely, 2221131333113230 is an apocalyptic number.
221131333113230 is a deficient number, since it is larger than the sum of its proper divisors (176905066490602).
221131333113230 is a wasteful number, since it uses less digits than its factorization.
221131333113230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22113133311330.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 221131333113230 its reverse (32311333131122), we get a palindrome (253442666244352).
The spelling of 221131333113230 in words is "two hundred twenty-one trillion, one hundred thirty-one billion, three hundred thirty-three million, one hundred thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •