Base | Representation |
---|---|
bin | 1001010100111011010011… |
… | …1110101000101111100001 |
3 | 1100022101021011122101112201 |
4 | 2111032310332220233201 |
5 | 2321004443023113431 |
6 | 33451045533453201 |
7 | 2105623341255325 |
oct | 225166476505741 |
9 | 40271234571481 |
10 | 10255123254241 |
11 | 32a419a7a9a88 |
12 | 1197618041201 |
13 | 59509176c1a8 |
14 | 2764ca127985 |
15 | 12bb5c90d461 |
hex | 953b4fa8be1 |
10255123254241 has 2 divisors, whose sum is σ = 10255123254242. Its totient is φ = 10255123254240.
The previous prime is 10255123254227. The next prime is 10255123254281. The reversal of 10255123254241 is 14245232155201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9385154790400 + 869968463841 = 3063520^2 + 932721^2 .
It is an emirp because it is prime and its reverse (14245232155201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10255123254241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10255123254241.
It is not a weakly prime, because it can be changed into another prime (10255123254281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5127561627120 + 5127561627121.
It is an arithmetic number, because the mean of its divisors is an integer number (5127561627121).
Almost surely, 210255123254241 is an apocalyptic number.
It is an amenable number.
10255123254241 is a deficient number, since it is larger than the sum of its proper divisors (1).
10255123254241 is an equidigital number, since it uses as much as digits as its factorization.
10255123254241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96000, while the sum is 37.
The spelling of 10255123254241 in words is "ten trillion, two hundred fifty-five billion, one hundred twenty-three million, two hundred fifty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •