Base | Representation |
---|---|
bin | 1100110100111011010101… |
… | …0110001010111111100101 |
3 | 1211221021101121010110002122 |
4 | 3031032311112022333211 |
5 | 3322032301022333221 |
6 | 45555004411115325 |
7 | 2653636620025355 |
oct | 315166526127745 |
9 | 54837347113078 |
10 | 14103420121061 |
11 | 4548254a8a317 |
12 | 16b9406a42b45 |
13 | 7b3c401b2a5b |
14 | 36a875816b65 |
15 | 196ce0516eab |
hex | cd3b558afe5 |
14103420121061 has 2 divisors, whose sum is σ = 14103420121062. Its totient is φ = 14103420121060.
The previous prime is 14103420121031. The next prime is 14103420121073. The reversal of 14103420121061 is 16012102430141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12116532536161 + 1986887584900 = 3480881^2 + 1409570^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14103420121061 is a prime.
It is a super-2 number, since 2×141034201210612 (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 14103420121061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14103420121031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7051710060530 + 7051710060531.
It is an arithmetic number, because the mean of its divisors is an integer number (7051710060531).
Almost surely, 214103420121061 is an apocalyptic number.
It is an amenable number.
14103420121061 is a deficient number, since it is larger than the sum of its proper divisors (1).
14103420121061 is an equidigital number, since it uses as much as digits as its factorization.
14103420121061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 14103420121061 in words is "fourteen trillion, one hundred three billion, four hundred twenty million, one hundred twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •