Base | Representation |
---|---|
bin | 1100000110110011111000… |
… | …0001100000000001101111 |
3 | 1202010112101112021011000202 |
4 | 3001230332001200001233 |
5 | 3221042210410343043 |
6 | 44151015533144115 |
7 | 2542461364051352 |
oct | 301547601400157 |
9 | 52115345234022 |
10 | 13311144231023 |
11 | 4272251996781 |
12 | 15ab95732b03b |
13 | 75730a570762 |
14 | 340397260299 |
15 | 1813c03c51b8 |
hex | c1b3e06006f |
13311144231023 has 2 divisors, whose sum is σ = 13311144231024. Its totient is φ = 13311144231022.
The previous prime is 13311144230899. The next prime is 13311144231029. The reversal of 13311144231023 is 32013244111331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13311144231023 - 238 = 13036266324079 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13311144231029) 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, 6655572115511 + 6655572115512.
It is an arithmetic number, because the mean of its divisors is an integer number (6655572115512).
Almost surely, 213311144231023 is an apocalyptic number.
13311144231023 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311144231023 is an equidigital number, since it uses as much as digits as its factorization.
13311144231023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 13311144231023 its reverse (32013244111331), we get a palindrome (45324388342354).
The spelling of 13311144231023 in words is "thirteen trillion, three hundred eleven billion, one hundred forty-four million, two hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •