Base | Representation |
---|---|
bin | 1011111100011101011100… |
… | …0100100100001100011111 |
3 | 1201111112101212212000211121 |
4 | 2333013113010210030133 |
5 | 3210134021232302033 |
6 | 43533210534031411 |
7 | 2523564665214523 |
oct | 277072704441437 |
9 | 51445355760747 |
10 | 13133323322143 |
11 | 42038a16a2a52 |
12 | 15813ab4a8567 |
13 | 74360c21984b |
14 | 335928a1bd83 |
15 | 17b96415862d |
hex | bf1d712431f |
13133323322143 has 2 divisors, whose sum is σ = 13133323322144. Its totient is φ = 13133323322142.
The previous prime is 13133323322129. The next prime is 13133323322237. The reversal of 13133323322143 is 34122332333131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13133323322143 - 213 = 13133323313951 is a prime.
It is a super-2 number, since 2×131333233221432 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13133323322099 and 13133323322108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13133323422143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6566661661071 + 6566661661072.
It is an arithmetic number, because the mean of its divisors is an integer number (6566661661072).
Almost surely, 213133323322143 is an apocalyptic number.
13133323322143 is a deficient number, since it is larger than the sum of its proper divisors (1).
13133323322143 is an equidigital number, since it uses as much as digits as its factorization.
13133323322143 is an evil number, because the sum of its binary digits is even.
The product of its digits is 69984, while the sum is 34.
Adding to 13133323322143 its reverse (34122332333131), we get a palindrome (47255655655274).
The spelling of 13133323322143 in words is "thirteen trillion, one hundred thirty-three billion, three hundred twenty-three million, three hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •