Base | Representation |
---|---|
bin | 1100001110100100011010… |
… | …0111010011000100110111 |
3 | 1202121021102121100210210122 |
4 | 3003221012213103010313 |
5 | 3230233144134441401 |
6 | 44332141552042155 |
7 | 2555220365240132 |
oct | 303510647230467 |
9 | 52537377323718 |
10 | 13444432343351 |
11 | 431382a620309 |
12 | 161175523335b |
13 | 766a5c724789 |
14 | 3469dd2cd219 |
15 | 184ac1c3e21b |
hex | c3a469d3137 |
13444432343351 has 2 divisors, whose sum is σ = 13444432343352. Its totient is φ = 13444432343350.
The previous prime is 13444432343317. The next prime is 13444432343357. The reversal of 13444432343351 is 15334323444431.
13444432343351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13444432343351 is a prime.
It is a super-2 number, since 2×134444323433512 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13444432343357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6722216171675 + 6722216171676.
It is an arithmetic number, because the mean of its divisors is an integer number (6722216171676).
Almost surely, 213444432343351 is an apocalyptic number.
13444432343351 is a deficient number, since it is larger than the sum of its proper divisors (1).
13444432343351 is an equidigital number, since it uses as much as digits as its factorization.
13444432343351 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2488320, while the sum is 44.
Adding to 13444432343351 its reverse (15334323444431), we get a palindrome (28778755787782).
The spelling of 13444432343351 in words is "thirteen trillion, four hundred forty-four billion, four hundred thirty-two million, three hundred forty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •