Base | Representation |
---|---|
bin | 100001000111101… |
… | …1001000110001101 |
3 | 2212110011110211022 |
4 | 1002033121012031 |
5 | 4234000044323 |
6 | 302135403525 |
7 | 36353105456 |
oct | 10217310615 |
9 | 2773143738 |
10 | 1111331213 |
11 | 520354653 |
12 | 2702235a5 |
13 | 14931a445 |
14 | a784c12d |
15 | 678734c8 |
hex | 423d918d |
1111331213 has 2 divisors, whose sum is σ = 1111331214. Its totient is φ = 1111331212.
The previous prime is 1111331201. The next prime is 1111331237. The reversal of 1111331213 is 3121331111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1073348644 + 37982569 = 32762^2 + 6163^2 .
It is an emirp because it is prime and its reverse (3121331111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1111331213 - 24 = 1111331197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111331191 and 1111331200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111331513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555665606 + 555665607.
It is an arithmetic number, because the mean of its divisors is an integer number (555665607).
Almost surely, 21111331213 is an apocalyptic number.
It is an amenable number.
1111331213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111331213 is an equidigital number, since it uses as much as digits as its factorization.
1111331213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 54, while the sum is 17.
The square root of 1111331213 is about 33336.6346981815. The cubic root of 1111331213 is about 1035.8125549103.
Adding to 1111331213 its reverse (3121331111), we get a palindrome (4232662324).
The spelling of 1111331213 in words is "one billion, one hundred eleven million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •