Base | Representation |
---|---|
bin | 10100101100100011… |
… | …11100011100010101 |
3 | 1001200100201111210012 |
4 | 22112101330130111 |
5 | 140223433033023 |
6 | 5034320010005 |
7 | 542226551234 |
oct | 122621743425 |
9 | 31610644705 |
10 | 11111221013 |
11 | 4791aa3892 |
12 | 21a1160905 |
13 | 1080c996b9 |
14 | 775982b1b |
15 | 45070d978 |
hex | 29647c715 |
11111221013 has 2 divisors, whose sum is σ = 11111221014. Its totient is φ = 11111221012.
The previous prime is 11111221007. The next prime is 11111221049. The reversal of 11111221013 is 31012211111.
11111221013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10658084644 + 453136369 = 103238^2 + 21287^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11111221013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111221213) 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, 5555610506 + 5555610507.
It is an arithmetic number, because the mean of its divisors is an integer number (5555610507).
Almost surely, 211111221013 is an apocalyptic number.
It is an amenable number.
11111221013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111221013 is an equidigital number, since it uses as much as digits as its factorization.
11111221013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11111221013 its reverse (31012211111), we get a palindrome (42123432124).
The spelling of 11111221013 in words is "eleven billion, one hundred eleven million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •