Base | Representation |
---|---|
bin | 10110101000010100101… |
… | …111101110010110101101 |
3 | 12111200001102100001212022 |
4 | 112220110233232112231 |
5 | 200434344302403414 |
6 | 3150225355515525 |
7 | 220232322506534 |
oct | 26502457562655 |
9 | 5450042301768 |
10 | 1555126216109 |
11 | 54a586230484 |
12 | 211488758ba5 |
13 | b38562072ab |
14 | 553a8b1531b |
15 | 2a6bbcc818e |
hex | 16a14bee5ad |
1555126216109 has 2 divisors, whose sum is σ = 1555126216110. Its totient is φ = 1555126216108.
The previous prime is 1555126216013. The next prime is 1555126216211. The reversal of 1555126216109 is 9016126215551.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 831282592009 + 723843624100 = 911747^2 + 850790^2 .
It is a cyclic number.
It is not a de Polignac number, because 1555126216109 - 224 = 1555109438893 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1555126216109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1555126216309) 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, 777563108054 + 777563108055.
It is an arithmetic number, because the mean of its divisors is an integer number (777563108055).
Almost surely, 21555126216109 is an apocalyptic number.
It is an amenable number.
1555126216109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1555126216109 is an equidigital number, since it uses as much as digits as its factorization.
1555126216109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 44.
The spelling of 1555126216109 in words is "one trillion, five hundred fifty-five billion, one hundred twenty-six million, two hundred sixteen thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •