Base | Representation |
---|---|
bin | 1101000001101110001001… |
… | …1100010010011110000001 |
3 | 1212201021201211102210101011 |
4 | 3100123202130102132001 |
5 | 3334132423312000421 |
6 | 50243555122040521 |
7 | 3005550513316363 |
oct | 320334234223601 |
9 | 55637654383334 |
10 | 14323220031361 |
11 | 462249733614a |
12 | 1733b294a9141 |
13 | 7cb89b5c0787 |
14 | 3773673b6d33 |
15 | 19c8a6d814e1 |
hex | d06e2712781 |
14323220031361 has 2 divisors, whose sum is σ = 14323220031362. Its totient is φ = 14323220031360.
The previous prime is 14323220031221. The next prime is 14323220031433. The reversal of 14323220031361 is 16313002232341.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14218321776961 + 104898254400 = 3770719^2 + 323880^2 .
It is a cyclic number.
It is not a de Polignac number, because 14323220031361 - 213 = 14323220023169 is a prime.
It is a super-3 number, since 3×143232200313613 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (14323220001361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7161610015680 + 7161610015681.
It is an arithmetic number, because the mean of its divisors is an integer number (7161610015681).
Almost surely, 214323220031361 is an apocalyptic number.
It is an amenable number.
14323220031361 is a deficient number, since it is larger than the sum of its proper divisors (1).
14323220031361 is an equidigital number, since it uses as much as digits as its factorization.
14323220031361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 31.
The spelling of 14323220031361 in words is "fourteen trillion, three hundred twenty-three billion, two hundred twenty million, thirty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •