Base | Representation |
---|---|
bin | 1010001101110110111110… |
… | …1100000010100110100001 |
3 | 1110202212212221121120021012 |
4 | 2203131233230002212201 |
5 | 2433021110100420014 |
6 | 35520244505510305 |
7 | 2236400332401236 |
oct | 243355754024641 |
9 | 43685787546235 |
10 | 11233213295009 |
11 | 3640a85068252 |
12 | 13150a44a2395 |
13 | 6363977503c4 |
14 | 2ab99474b78d |
15 | 1473058cec3e |
hex | a376fb029a1 |
11233213295009 has 2 divisors, whose sum is σ = 11233213295010. Its totient is φ = 11233213295008.
The previous prime is 11233213294987. The next prime is 11233213295021. The reversal of 11233213295009 is 90059231233211.
11233213295009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7975134144784 + 3258079150225 = 2824028^2 + 1805015^2 .
It is an emirp because it is prime and its reverse (90059231233211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11233213295009 - 232 = 11228918327713 is a prime.
It is not a weakly prime, because it can be changed into another prime (11233213295039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5616606647504 + 5616606647505.
It is an arithmetic number, because the mean of its divisors is an integer number (5616606647505).
Almost surely, 211233213295009 is an apocalyptic number.
It is an amenable number.
11233213295009 is a deficient number, since it is larger than the sum of its proper divisors (1).
11233213295009 is an equidigital number, since it uses as much as digits as its factorization.
11233213295009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 87480, while the sum is 41.
The spelling of 11233213295009 in words is "eleven trillion, two hundred thirty-three billion, two hundred thirteen million, two hundred ninety-five thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •