Base | Representation |
---|---|
bin | 1010010011100100011101… |
… | …0100010011100001001101 |
3 | 1111010021010012010100021121 |
4 | 2210321013110103201031 |
5 | 2441123020434411023 |
6 | 40033311530000541 |
7 | 2246442451531525 |
oct | 244710724234115 |
9 | 44107105110247 |
10 | 11331320232013 |
11 | 3679649956081 |
12 | 1330104276151 |
13 | 642700cb7912 |
14 | 2b26201cc685 |
15 | 149b4882bd5d |
hex | a4e4751384d |
11331320232013 has 2 divisors, whose sum is σ = 11331320232014. Its totient is φ = 11331320232012.
The previous prime is 11331320231983. The next prime is 11331320232017. The reversal of 11331320232013 is 31023202313311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7830522066249 + 3500798165764 = 2798307^2 + 1871042^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331320232013 - 221 = 11331318134861 is a prime.
It is a super-3 number, since 3×113313202320133 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331320232017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665660116006 + 5665660116007.
It is an arithmetic number, because the mean of its divisors is an integer number (5665660116007).
Almost surely, 211331320232013 is an apocalyptic number.
It is an amenable number.
11331320232013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331320232013 is an equidigital number, since it uses as much as digits as its factorization.
11331320232013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 11331320232013 its reverse (31023202313311), we get a palindrome (42354522545324).
The spelling of 11331320232013 in words is "eleven trillion, three hundred thirty-one billion, three hundred twenty million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •