Base | Representation |
---|---|
bin | 1010010011100011101011… |
… | …1010000000001001011101 |
3 | 1111010020120200022120211112 |
4 | 2210320322322000021131 |
5 | 2441122104133312313 |
6 | 40033235131031405 |
7 | 2246434342632323 |
oct | 244707272001135 |
9 | 44106520276745 |
10 | 11331112010333 |
11 | 3679552368045 |
12 | 133006659b565 |
13 | 642699b1231b |
14 | 2b26006a9d13 |
15 | 149b353eb8a8 |
hex | a4e3ae8025d |
11331112010333 has 2 divisors, whose sum is σ = 11331112010334. Its totient is φ = 11331112010332.
The previous prime is 11331112010269. The next prime is 11331112010369. The reversal of 11331112010333 is 33301021113311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11330615745604 + 496264729 = 3366098^2 + 22277^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331112010333 - 26 = 11331112010269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331112010299 and 11331112010308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331112010833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665556005166 + 5665556005167.
It is an arithmetic number, because the mean of its divisors is an integer number (5665556005167).
Almost surely, 211331112010333 is an apocalyptic number.
It is an amenable number.
11331112010333 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331112010333 is an equidigital number, since it uses as much as digits as its factorization.
11331112010333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11331112010333 its reverse (33301021113311), we get a palindrome (44632133123644).
The spelling of 11331112010333 in words is "eleven trillion, three hundred thirty-one billion, one hundred twelve million, ten thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •