Base | Representation |
---|---|
bin | 1001000001101010000… |
… | …0000001000011101101 |
3 | 112211020122012001201122 |
4 | 2100122200001003231 |
5 | 10020032214020323 |
6 | 155122443150325 |
7 | 14126421231026 |
oct | 2203240010355 |
9 | 484218161648 |
10 | 155063423213 |
11 | 5a842294a36 |
12 | 260765153a5 |
13 | 118125b617a |
14 | 7710041c4d |
15 | 40783b2ec8 |
hex | 241a8010ed |
155063423213 has 2 divisors, whose sum is σ = 155063423214. Its totient is φ = 155063423212.
The previous prime is 155063423209. The next prime is 155063423227. The reversal of 155063423213 is 312324360551.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107897139529 + 47166283684 = 328477^2 + 217178^2 .
It is a cyclic number.
It is not a de Polignac number, because 155063423213 - 22 = 155063423209 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155063423243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77531711606 + 77531711607.
It is an arithmetic number, because the mean of its divisors is an integer number (77531711607).
Almost surely, 2155063423213 is an apocalyptic number.
It is an amenable number.
155063423213 is a deficient number, since it is larger than the sum of its proper divisors (1).
155063423213 is an equidigital number, since it uses as much as digits as its factorization.
155063423213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 155063423213 its reverse (312324360551), we get a palindrome (467387783764).
The spelling of 155063423213 in words is "one hundred fifty-five billion, sixty-three million, four hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •