Base | Representation |
---|---|
bin | 1100110000000110001001… |
… | …1001000110001001000101 |
3 | 1211122100011110021122202112 |
4 | 3030001202121012021011 |
5 | 3314202312021000234 |
6 | 45452521024150405 |
7 | 2644641114445214 |
oct | 314014231061105 |
9 | 54570143248675 |
10 | 14020424000069 |
11 | 4516034922193 |
12 | 16a5303768405 |
13 | 7a91744241a6 |
14 | 366840ba507b |
15 | 194a83ebdace |
hex | cc062646245 |
14020424000069 has 2 divisors, whose sum is σ = 14020424000070. Its totient is φ = 14020424000068.
The previous prime is 14020423999991. The next prime is 14020424000081. The reversal of 14020424000069 is 96000042402041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13336643851969 + 683780148100 = 3651937^2 + 826910^2 .
It is a cyclic number.
It is not a de Polignac number, because 14020424000069 - 212 = 14020423995973 is a prime.
It is a super-2 number, since 2×140204240000692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14020423999999 and 14020424000044.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14020424009069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7010212000034 + 7010212000035.
It is an arithmetic number, because the mean of its divisors is an integer number (7010212000035).
Almost surely, 214020424000069 is an apocalyptic number.
It is an amenable number.
14020424000069 is a deficient number, since it is larger than the sum of its proper divisors (1).
14020424000069 is an equidigital number, since it uses as much as digits as its factorization.
14020424000069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 32.
The spelling of 14020424000069 in words is "fourteen trillion, twenty billion, four hundred twenty-four million, sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •