Base | Representation |
---|---|
bin | 110010010101111101101010… |
… | …001011000100100001111011 |
3 | 1002000221202010220111002000102 |
4 | 302111331222023010201323 |
5 | 213010102014413110011 |
6 | 2102523034155430015 |
7 | 64431314565421301 |
oct | 6225755213044173 |
9 | 1060852126432012 |
10 | 221411640363131 |
11 | 64604170882799 |
12 | 209bb08645530b |
13 | 96710499628ca |
14 | 3c96548410271 |
15 | 1a8e658e6673b |
hex | c95f6a2c487b |
221411640363131 has 16 divisors (see below), whose sum is σ = 228851377574400. Its totient is φ = 214085707595808.
The previous prime is 221411640363073. The next prime is 221411640363149. The reversal of 221411640363131 is 131363046114122.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221411640363131 is a prime.
It is a super-2 number, since 2×2214116403631312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221411640363191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 208677560 + ... + 209735898.
It is an arithmetic number, because the mean of its divisors is an integer number (14303211098400).
Almost surely, 2221411640363131 is an apocalyptic number.
221411640363131 is a deficient number, since it is larger than the sum of its proper divisors (7439737211269).
221411640363131 is a wasteful number, since it uses less digits than its factorization.
221411640363131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112098.
The product of its (nonzero) digits is 62208, while the sum is 38.
Adding to 221411640363131 its reverse (131363046114122), we get a palindrome (352774686477253).
The spelling of 221411640363131 in words is "two hundred twenty-one trillion, four hundred eleven billion, six hundred forty million, three hundred sixty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •