Base | Representation |
---|---|
bin | 1011111011001000000011… |
… | …0100011000100101100001 |
3 | 1201102100020102012220100222 |
4 | 2332302000310120211201 |
5 | 3204300100224400413 |
6 | 43514500225452425 |
7 | 2522123653136561 |
oct | 276620064304541 |
9 | 51370212186328 |
10 | 13110401403233 |
11 | 41a50a9894012 |
12 | 1578a72aa1115 |
13 | 7413c8398514 |
14 | 334792656da1 |
15 | 17b071b1db08 |
hex | bec80d18961 |
13110401403233 has 2 divisors, whose sum is σ = 13110401403234. Its totient is φ = 13110401403232.
The previous prime is 13110401403221. The next prime is 13110401403263. The reversal of 13110401403233 is 33230410401131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12872717852449 + 237683550784 = 3587857^2 + 487528^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13110401403233 is a prime.
It is not a weakly prime, because it can be changed into another prime (13110401403263) 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, 6555200701616 + 6555200701617.
It is an arithmetic number, because the mean of its divisors is an integer number (6555200701617).
Almost surely, 213110401403233 is an apocalyptic number.
It is an amenable number.
13110401403233 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110401403233 is an equidigital number, since it uses as much as digits as its factorization.
13110401403233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 13110401403233 its reverse (33230410401131), we get a palindrome (46340811804364).
The spelling of 13110401403233 in words is "thirteen trillion, one hundred ten billion, four hundred one million, four hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •