Base | Representation |
---|---|
bin | 110010010100100010001100… |
… | …100101110011111001001111 |
3 | 1002000121100122201001002021120 |
4 | 302110202030211303321033 |
5 | 213001444402442103130 |
6 | 2102405553210532023 |
7 | 64421240124324123 |
oct | 6224421445637117 |
9 | 1060540581032246 |
10 | 221313433550415 |
11 | 64576555678858 |
12 | 209a4039137013 |
13 | 96649c87c933b |
14 | 3c918ad5b1583 |
15 | 1a8bd0c38b910 |
hex | c9488c973e4f |
221313433550415 has 64 divisors (see below), whose sum is σ = 368003873064960. Its totient is φ = 113438161464320.
The previous prime is 221313433550413. The next prime is 221313433550423. The reversal of 221313433550415 is 514055334313122.
221313433550415 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 221313433550415 - 21 = 221313433550413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221313433550413) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 114800602 + ... + 116712488.
It is an arithmetic number, because the mean of its divisors is an integer number (5750060516640).
Almost surely, 2221313433550415 is an apocalyptic number.
221313433550415 is a deficient number, since it is larger than the sum of its proper divisors (146690439514545).
221313433550415 is a wasteful number, since it uses less digits than its factorization.
221313433550415 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1913152.
The product of its (nonzero) digits is 648000, while the sum is 42.
Adding to 221313433550415 its reverse (514055334313122), we get a palindrome (735368767863537).
The spelling of 221313433550415 in words is "two hundred twenty-one trillion, three hundred thirteen billion, four hundred thirty-three million, five hundred fifty thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •