Base | Representation |
---|---|
bin | 1001010100111111100001… |
… | …1100110100110011011101 |
3 | 1100022111012001200022001102 |
4 | 2111033320130310303131 |
5 | 2321014302320211222 |
6 | 33451354132122445 |
7 | 2105663365064462 |
oct | 225177034646335 |
9 | 40274161608042 |
10 | 10256255241437 |
11 | 32a4720781797 |
12 | 1197893166425 |
13 | 59521213c4ba |
14 | 2765965d1669 |
15 | 12bbc6eb1d92 |
hex | 953f8734cdd |
10256255241437 has 2 divisors, whose sum is σ = 10256255241438. Its totient is φ = 10256255241436.
The previous prime is 10256255241373. The next prime is 10256255241443. The reversal of 10256255241437 is 73414255265201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5283060877081 + 4973194364356 = 2298491^2 + 2230066^2 .
It is an emirp because it is prime and its reverse (73414255265201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10256255241437 - 26 = 10256255241373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10256255241391 and 10256255241400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10256255240437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5128127620718 + 5128127620719.
It is an arithmetic number, because the mean of its divisors is an integer number (5128127620719).
Almost surely, 210256255241437 is an apocalyptic number.
It is an amenable number.
10256255241437 is a deficient number, since it is larger than the sum of its proper divisors (1).
10256255241437 is an equidigital number, since it uses as much as digits as its factorization.
10256255241437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016000, while the sum is 47.
The spelling of 10256255241437 in words is "ten trillion, two hundred fifty-six billion, two hundred fifty-five million, two hundred forty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •