Base | Representation |
---|---|
bin | 1100110101010110010000… |
… | …0010111100010100110101 |
3 | 1211221222001012000012022101 |
4 | 3031111210002330110311 |
5 | 3322142100342412331 |
6 | 50002201420102101 |
7 | 2654313651345625 |
oct | 315254402742465 |
9 | 54858035005271 |
10 | 14110646060341 |
11 | 4550322923466 |
12 | 16ba8a2994931 |
13 | 7b482225587c |
14 | 36ad5d388885 |
15 | 1970b4ab1061 |
hex | cd5640bc535 |
14110646060341 has 2 divisors, whose sum is σ = 14110646060342. Its totient is φ = 14110646060340.
The previous prime is 14110646060267. The next prime is 14110646060347. The reversal of 14110646060341 is 14306064601141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12200594914225 + 1910051146116 = 3492935^2 + 1382046^2 .
It is a cyclic number.
It is not a de Polignac number, because 14110646060341 - 237 = 13973207106869 is a prime.
It is a super-2 number, since 2×141106460603412 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14110646060341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14110646060347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7055323030170 + 7055323030171.
It is an arithmetic number, because the mean of its divisors is an integer number (7055323030171).
Almost surely, 214110646060341 is an apocalyptic number.
It is an amenable number.
14110646060341 is a deficient number, since it is larger than the sum of its proper divisors (1).
14110646060341 is an equidigital number, since it uses as much as digits as its factorization.
14110646060341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 14110646060341 in words is "fourteen trillion, one hundred ten billion, six hundred forty-six million, sixty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •