Base | Representation |
---|---|
bin | 10100100110111101… |
… | …01000011100101101 |
3 | 1001120002021101010101 |
4 | 22103132220130231 |
5 | 140124414342331 |
6 | 5025520311101 |
7 | 541116164404 |
oct | 122336503455 |
9 | 31502241111 |
10 | 11064215341 |
11 | 4768508823 |
12 | 2189472491 |
13 | 107431c1aa |
14 | 76d62863b |
15 | 44b526061 |
hex | 2937a872d |
11064215341 has 2 divisors, whose sum is σ = 11064215342. Its totient is φ = 11064215340.
The previous prime is 11064215321. The next prime is 11064215369. The reversal of 11064215341 is 14351246011.
It is an a-pointer prime, because the next prime (11064215369) can be obtained adding 11064215341 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11060939241 + 3276100 = 105171^2 + 1810^2 .
It is an emirp because it is prime and its reverse (14351246011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11064215341 - 221 = 11062118189 is a prime.
It is a super-3 number, since 3×110642153413 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11064215321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5532107670 + 5532107671.
It is an arithmetic number, because the mean of its divisors is an integer number (5532107671).
Almost surely, 211064215341 is an apocalyptic number.
It is an amenable number.
11064215341 is a deficient number, since it is larger than the sum of its proper divisors (1).
11064215341 is an equidigital number, since it uses as much as digits as its factorization.
11064215341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 28.
The spelling of 11064215341 in words is "eleven billion, sixty-four million, two hundred fifteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •