Base | Representation |
---|---|
bin | 1100110110001011111001… |
… | …0011110011100011111001 |
3 | 1212000100012200202222221011 |
4 | 3031202332103303203321 |
5 | 3322411043101112332 |
6 | 50012542314313521 |
7 | 2655333535214251 |
oct | 315427623634371 |
9 | 55010180688834 |
10 | 14125045332217 |
11 | 455644193a556 |
12 | 17016411288a1 |
13 | 7b5ca84ac7a1 |
14 | 36b9278b6961 |
15 | 197658cb1e47 |
hex | cd8be4f38f9 |
14125045332217 has 2 divisors, whose sum is σ = 14125045332218. Its totient is φ = 14125045332216.
The previous prime is 14125045332199. The next prime is 14125045332239. The reversal of 14125045332217 is 71223354052141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10260003359376 + 3865041972841 = 3203124^2 + 1965971^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14125045332217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14125045332217.
It is not a weakly prime, because it can be changed into another prime (14125045362217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7062522666108 + 7062522666109.
It is an arithmetic number, because the mean of its divisors is an integer number (7062522666109).
Almost surely, 214125045332217 is an apocalyptic number.
It is an amenable number.
14125045332217 is a deficient number, since it is larger than the sum of its proper divisors (1).
14125045332217 is an equidigital number, since it uses as much as digits as its factorization.
14125045332217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 201600, while the sum is 40.
Adding to 14125045332217 its reverse (71223354052141), we get a palindrome (85348399384358).
The spelling of 14125045332217 in words is "fourteen trillion, one hundred twenty-five billion, forty-five million, three hundred thirty-two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •