Base | Representation |
---|---|
bin | 111001101000110001… |
… | …1111100000101000001 |
3 | 102211111002101121112122 |
4 | 1303101203330011001 |
5 | 4011442341143203 |
6 | 132510022334025 |
7 | 11641154442512 |
oct | 1632143740501 |
9 | 384432347478 |
10 | 123774943553 |
11 | 48546802088 |
12 | 1bba3b8a315 |
13 | b8972ba991 |
14 | 5dc2834a09 |
15 | 33465c2538 |
hex | 1cd18fc141 |
123774943553 has 2 divisors, whose sum is σ = 123774943554. Its totient is φ = 123774943552.
The previous prime is 123774943477. The next prime is 123774943597. The reversal of 123774943553 is 355349477321.
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., 114970499329 + 8804444224 = 339073^2 + 93832^2 .
It is an emirp because it is prime and its reverse (355349477321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123774943553 - 226 = 123707834689 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 123774943495 and 123774943504.
It is not a weakly prime, because it can be changed into another prime (123774949553) 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, 61887471776 + 61887471777.
It is an arithmetic number, because the mean of its divisors is an integer number (61887471777).
Almost surely, 2123774943553 is an apocalyptic number.
It is an amenable number.
123774943553 is a deficient number, since it is larger than the sum of its proper divisors (1).
123774943553 is an equidigital number, since it uses as much as digits as its factorization.
123774943553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9525600, while the sum is 53.
The spelling of 123774943553 in words is "one hundred twenty-three billion, seven hundred seventy-four million, nine hundred forty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •