Base | Representation |
---|---|
bin | 10101000111000000… |
… | …11001010101111101 |
3 | 1002020211020210122211 |
4 | 22203200121111331 |
5 | 141202234110323 |
6 | 5112323540421 |
7 | 550562605252 |
oct | 124340312575 |
9 | 32224223584 |
10 | 11333113213 |
11 | 4896279774 |
12 | 224352a711 |
13 | 10b7c4a466 |
14 | 797223429 |
15 | 464e3e70d |
hex | 2a381957d |
11333113213 has 2 divisors, whose sum is σ = 11333113214. Its totient is φ = 11333113212.
The previous prime is 11333113177. The next prime is 11333113229. The reversal of 11333113213 is 31231133311.
11333113213 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., 6908601924 + 4424511289 = 83118^2 + 66517^2 .
It is a cyclic number.
It is not a de Polignac number, because 11333113213 - 29 = 11333112701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11333113313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5666556606 + 5666556607.
It is an arithmetic number, because the mean of its divisors is an integer number (5666556607).
Almost surely, 211333113213 is an apocalyptic number.
It is an amenable number.
11333113213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11333113213 is an equidigital number, since it uses as much as digits as its factorization.
11333113213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 486, while the sum is 22.
Adding to 11333113213 its reverse (31231133311), we get a palindrome (42564246524).
The spelling of 11333113213 in words is "eleven billion, three hundred thirty-three million, one hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •