Base | Representation |
---|---|
bin | 11100000100011111100110… |
… | …101100101010000100011101 |
3 | 121012010002122120101122022011 |
4 | 130010133212230222010131 |
5 | 112140133012024032021 |
6 | 1114322012050351221 |
7 | 35001160032133663 |
oct | 3404374654520435 |
9 | 535102576348264 |
10 | 123454115455261 |
11 | 36377661806828 |
12 | 11a1a29958b511 |
13 | 53b6899b51746 |
14 | 226b2d5264c33 |
15 | e414d15b6de1 |
hex | 7047e6b2a11d |
123454115455261 has 2 divisors, whose sum is σ = 123454115455262. Its totient is φ = 123454115455260.
The previous prime is 123454115455243. The next prime is 123454115455267. The reversal of 123454115455261 is 162554511454321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107018631890361 + 16435483564900 = 10344981^2 + 4054070^2 .
It is a cyclic number.
It is not a de Polignac number, because 123454115455261 - 211 = 123454115453213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123454115455267) 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, 61727057727630 + 61727057727631.
It is an arithmetic number, because the mean of its divisors is an integer number (61727057727631).
Almost surely, 2123454115455261 is an apocalyptic number.
It is an amenable number.
123454115455261 is a deficient number, since it is larger than the sum of its proper divisors (1).
123454115455261 is an equidigital number, since it uses as much as digits as its factorization.
123454115455261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2880000, while the sum is 49.
The spelling of 123454115455261 in words is "one hundred twenty-three trillion, four hundred fifty-four billion, one hundred fifteen million, four hundred fifty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •