Base | Representation |
---|---|
bin | 1100110000101111000101… |
… | …1101000110101011011001 |
3 | 1211200101112101010222010121 |
4 | 3030023301131012223121 |
5 | 3314342314004033241 |
6 | 45501535340513241 |
7 | 2645510344131433 |
oct | 314136135065331 |
9 | 54611471128117 |
10 | 14031414127321 |
11 | 451a764527488 |
12 | 16a747024b821 |
13 | 7aa2062a2b76 |
14 | 3671a4625653 |
15 | 194ec8c5cad1 |
hex | cc2f1746ad9 |
14031414127321 has 2 divisors, whose sum is σ = 14031414127322. Its totient is φ = 14031414127320.
The previous prime is 14031414127309. The next prime is 14031414127333. The reversal of 14031414127321 is 12372141413041.
It is a balanced prime because it is at equal distance from previous prime (14031414127309) and next prime (14031414127333).
It can be written as a sum of positive squares in only one way, i.e., 8769528672921 + 5261885454400 = 2961339^2 + 2293880^2 .
It is a cyclic number.
It is not a de Polignac number, because 14031414127321 - 215 = 14031414094553 is a prime.
It is not a weakly prime, because it can be changed into another prime (14031414128321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7015707063660 + 7015707063661.
It is an arithmetic number, because the mean of its divisors is an integer number (7015707063661).
Almost surely, 214031414127321 is an apocalyptic number.
It is an amenable number.
14031414127321 is a deficient number, since it is larger than the sum of its proper divisors (1).
14031414127321 is an equidigital number, since it uses as much as digits as its factorization.
14031414127321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 34.
The spelling of 14031414127321 in words is "fourteen trillion, thirty-one billion, four hundred fourteen million, one hundred twenty-seven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •