Base | Representation |
---|---|
bin | 100011101100101110111010… |
… | …1011000010111001110110101 |
3 | 1112011211012010000122201100111 |
4 | 1013121131311120113032311 |
5 | 312124230142231024431 |
6 | 3031502451020543021 |
7 | 123066366214451335 |
oct | 10731356530271665 |
9 | 1464735100581314 |
10 | 314011323298741 |
11 | 910654aa820042 |
12 | 2b2755b89b1a71 |
13 | 1062a1aa24ac23 |
14 | 577832ca910c5 |
15 | 264824d8ad7b1 |
hex | 11d97756173b5 |
314011323298741 has 2 divisors, whose sum is σ = 314011323298742. Its totient is φ = 314011323298740.
The previous prime is 314011323298733. The next prime is 314011323298753. The reversal of 314011323298741 is 147892323110413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 271595475863716 + 42415847435025 = 16480154^2 + 6512745^2 .
It is a cyclic number.
It is not a de Polignac number, because 314011323298741 - 23 = 314011323298733 is a prime.
It is a super-2 number, since 2×3140113232987412 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (314011323290741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157005661649370 + 157005661649371.
It is an arithmetic number, because the mean of its divisors is an integer number (157005661649371).
Almost surely, 2314011323298741 is an apocalyptic number.
It is an amenable number.
314011323298741 is a deficient number, since it is larger than the sum of its proper divisors (1).
314011323298741 is an equidigital number, since it uses as much as digits as its factorization.
314011323298741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 870912, while the sum is 49.
The spelling of 314011323298741 in words is "three hundred fourteen trillion, eleven billion, three hundred twenty-three million, two hundred ninety-eight thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •