Base | Representation |
---|---|
bin | 111101000000111011000011… |
… | …010111011000101101010001 |
3 | 1022012010110101202222202122021 |
4 | 331000323003113120231101 |
5 | 240133023003032011441 |
6 | 2350415351040211441 |
7 | 110344142350541551 |
oct | 7500730327305521 |
9 | 1265113352882567 |
10 | 268344244407121 |
11 | 7855917827a903 |
12 | 2611aab4609b81 |
13 | b6969a4a68b7c |
14 | 4a39d05cc1161 |
15 | 21053b26a03d1 |
hex | f40ec35d8b51 |
268344244407121 has 2 divisors, whose sum is σ = 268344244407122. Its totient is φ = 268344244407120.
The previous prime is 268344244407053. The next prime is 268344244407221. The reversal of 268344244407121 is 121704442443862.
268344244407121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 223660848537025 + 44683395870096 = 14955295^2 + 6684564^2 .
It is a cyclic number.
It is not a de Polignac number, because 268344244407121 - 27 = 268344244406993 is a prime.
It is not a weakly prime, because it can be changed into another prime (268344244407221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 134172122203560 + 134172122203561.
It is an arithmetic number, because the mean of its divisors is an integer number (134172122203561).
Almost surely, 2268344244407121 is an apocalyptic number.
It is an amenable number.
268344244407121 is a deficient number, since it is larger than the sum of its proper divisors (1).
268344244407121 is an equidigital number, since it uses as much as digits as its factorization.
268344244407121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8257536, while the sum is 52.
The spelling of 268344244407121 in words is "two hundred sixty-eight trillion, three hundred forty-four billion, two hundred forty-four million, four hundred seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •