Base | Representation |
---|---|
bin | 10001101011100110111… |
… | …111101001010000101101 |
3 | 11022011021100122101200202 |
4 | 101223212333221100231 |
5 | 124401413343034404 |
6 | 2330104503403245 |
7 | 153533140320524 |
oct | 21534677512055 |
9 | 4264240571622 |
10 | 1215056221229 |
11 | 429336618a34 |
12 | 17759ba53525 |
13 | 8a76b989a56 |
14 | 42b47dc54bb |
15 | 2191690821e |
hex | 11ae6fe942d |
1215056221229 has 2 divisors, whose sum is σ = 1215056221230. Its totient is φ = 1215056221228.
The previous prime is 1215056221199. The next prime is 1215056221241. The reversal of 1215056221229 is 9221226505121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1019086212004 + 195970009225 = 1009498^2 + 442685^2 .
It is a cyclic number.
It is not a de Polignac number, because 1215056221229 - 224 = 1215039444013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1215056221192 and 1215056221201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1215056221289) by changing a digit.
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 as a sum of consecutive naturals, namely, 607528110614 + 607528110615.
It is an arithmetic number, because the mean of its divisors is an integer number (607528110615).
Almost surely, 21215056221229 is an apocalyptic number.
It is an amenable number.
1215056221229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1215056221229 is an equidigital number, since it uses as much as digits as its factorization.
1215056221229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 38.
The spelling of 1215056221229 in words is "one trillion, two hundred fifteen billion, fifty-six million, two hundred twenty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •