Base | Representation |
---|---|
bin | 10111001000000001… |
… | …01111101100110101 |
3 | 1012001020122101011102 |
4 | 23210000233230311 |
5 | 200411311211341 |
6 | 5411543415445 |
7 | 616443415412 |
oct | 134400575465 |
9 | 35036571142 |
10 | 12415335221 |
11 | 52a1151123 |
12 | 24a5a54585 |
13 | 122b215203 |
14 | 85ac55109 |
15 | 4c9e62c9b |
hex | 2e402fb35 |
12415335221 has 2 divisors, whose sum is σ = 12415335222. Its totient is φ = 12415335220.
The previous prime is 12415335197. The next prime is 12415335239. The reversal of 12415335221 is 12253351421.
12415335221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9838656100 + 2576679121 = 99190^2 + 50761^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12415335221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12415334221) 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 as a sum of consecutive naturals, namely, 6207667610 + 6207667611.
It is an arithmetic number, because the mean of its divisors is an integer number (6207667611).
Almost surely, 212415335221 is an apocalyptic number.
It is an amenable number.
12415335221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12415335221 is an equidigital number, since it uses as much as digits as its factorization.
12415335221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7200, while the sum is 29.
Adding to 12415335221 its reverse (12253351421), we get a palindrome (24668686642).
The spelling of 12415335221 in words is "twelve billion, four hundred fifteen million, three hundred thirty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •