Base | Representation |
---|---|
bin | 1000010011111011… |
… | …1110001001101101 |
3 | 12202111012121211211 |
4 | 2010332332021231 |
5 | 14032130200023 |
6 | 1005220114421 |
7 | 106201015522 |
oct | 20476761155 |
9 | 5674177754 |
10 | 2231100013 |
11 | a4544150a |
12 | 523235a11 |
13 | 29730022c |
14 | 172455149 |
15 | d0d11a0d |
hex | 84fbe26d |
2231100013 has 2 divisors, whose sum is σ = 2231100014. Its totient is φ = 2231100012.
The previous prime is 2231099989. The next prime is 2231100019. The reversal of 2231100013 is 3100011322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1887294249 + 343805764 = 43443^2 + 18542^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2231100013 is a prime.
It is a super-3 number, since 3×22311000133 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2231099966 and 2231100002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2231100019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1115550006 + 1115550007.
It is an arithmetic number, because the mean of its divisors is an integer number (1115550007).
Almost surely, 22231100013 is an apocalyptic number.
It is an amenable number.
2231100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2231100013 is an equidigital number, since it uses as much as digits as its factorization.
2231100013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 2231100013 is about 47234.5214117810. The cubic root of 2231100013 is about 1306.6913401720.
Adding to 2231100013 its reverse (3100011322), we get a palindrome (5331111335).
The spelling of 2231100013 in words is "two billion, two hundred thirty-one million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •