Base | Representation |
---|---|
bin | 1101000001101110111110… |
… | …0111111110111100111001 |
3 | 1212201022022020121101000112 |
4 | 3100123233213332330321 |
5 | 3334133401421412303 |
6 | 50244033102314105 |
7 | 3005556140243603 |
oct | 320335747767471 |
9 | 55638266541015 |
10 | 14323441200953 |
11 | 46225a0168135 |
12 | 1733b8b588935 |
13 | 7cb90537a661 |
14 | 37738890a173 |
15 | 19c8bb4bd0d8 |
hex | d06ef9fef39 |
14323441200953 has 2 divisors, whose sum is σ = 14323441200954. Its totient is φ = 14323441200952.
The previous prime is 14323441200883. The next prime is 14323441200961. The reversal of 14323441200953 is 35900214432341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11506186373929 + 2817254827024 = 3392077^2 + 1678468^2 .
It is a cyclic number.
It is not a de Polignac number, because 14323441200953 - 28 = 14323441200697 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14323441200953.
It is not a weakly prime, because it can be changed into another prime (14323441200253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7161720600476 + 7161720600477.
It is an arithmetic number, because the mean of its divisors is an integer number (7161720600477).
Almost surely, 214323441200953 is an apocalyptic number.
It is an amenable number.
14323441200953 is a deficient number, since it is larger than the sum of its proper divisors (1).
14323441200953 is an equidigital number, since it uses as much as digits as its factorization.
14323441200953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 41.
The spelling of 14323441200953 in words is "fourteen trillion, three hundred twenty-three billion, four hundred forty-one million, two hundred thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •