Base | Representation |
---|---|
bin | 11011111110101000010011… |
… | …101000001111001010010001 |
3 | 121010200120111200101122020212 |
4 | 123332220103220033022101 |
5 | 112112032214420022421 |
6 | 1113412525302213505 |
7 | 34630103006204036 |
oct | 3376502350171221 |
9 | 533616450348225 |
10 | 123051142345361 |
11 | 36231772a0aa0a |
12 | 11974176724295 |
13 | 5387899585499 |
14 | 22559c829938d |
15 | e35c98b8be5b |
hex | 6fea13a0f291 |
123051142345361 has 2 divisors, whose sum is σ = 123051142345362. Its totient is φ = 123051142345360.
The previous prime is 123051142345331. The next prime is 123051142345441. The reversal of 123051142345361 is 163543241150321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111583708295761 + 11467434049600 = 10563319^2 + 3386360^2 .
It is a cyclic number.
It is not a de Polignac number, because 123051142345361 - 214 = 123051142328977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (123051142345331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61525571172680 + 61525571172681.
It is an arithmetic number, because the mean of its divisors is an integer number (61525571172681).
Almost surely, 2123051142345361 is an apocalyptic number.
It is an amenable number.
123051142345361 is a deficient number, since it is larger than the sum of its proper divisors (1).
123051142345361 is an equidigital number, since it uses as much as digits as its factorization.
123051142345361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 259200, while the sum is 41.
Adding to 123051142345361 its reverse (163543241150321), we get a palindrome (286594383495682).
The spelling of 123051142345361 in words is "one hundred twenty-three trillion, fifty-one billion, one hundred forty-two million, three hundred forty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •