Base | Representation |
---|---|
bin | 1011111101000010101100… |
… | …1010001101010100010001 |
3 | 1201112111012211221020000211 |
4 | 2333100223022031110101 |
5 | 3210320011422201113 |
6 | 43541543143444121 |
7 | 2524400551603132 |
oct | 277205312152421 |
9 | 51474184836024 |
10 | 13143324022033 |
11 | 4208063845887 |
12 | 1583320756641 |
13 | 7445440c074a |
14 | 3361d6cc3c89 |
15 | 17bd4c103b3d |
hex | bf42b28d511 |
13143324022033 has 2 divisors, whose sum is σ = 13143324022034. Its totient is φ = 13143324022032.
The previous prime is 13143324022021. The next prime is 13143324022039. The reversal of 13143324022033 is 33022042334131.
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., 11980230795009 + 1163093227024 = 3461247^2 + 1078468^2 .
It is a cyclic number.
It is not a de Polignac number, because 13143324022033 - 29 = 13143324021521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13143324021986 and 13143324022004.
It is not a weakly prime, because it can be changed into another prime (13143324022039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6571662011016 + 6571662011017.
It is an arithmetic number, because the mean of its divisors is an integer number (6571662011017).
Almost surely, 213143324022033 is an apocalyptic number.
It is an amenable number.
13143324022033 is a deficient number, since it is larger than the sum of its proper divisors (1).
13143324022033 is an equidigital number, since it uses as much as digits as its factorization.
13143324022033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 13143324022033 its reverse (33022042334131), we get a palindrome (46165366356164).
The spelling of 13143324022033 in words is "thirteen trillion, one hundred forty-three billion, three hundred twenty-four million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •