Base | Representation |
---|---|
bin | 111110100110011… |
… | …1101100101111101 |
3 | 12102101112222220122 |
4 | 1331030331211331 |
5 | 13300220100023 |
6 | 544234024325 |
7 | 103024244342 |
oct | 17514754575 |
9 | 5371488818 |
10 | 2100550013 |
11 | 988784351 |
12 | 4a75780a5 |
13 | 276251303 |
14 | 15cd907c9 |
15 | c46252c8 |
hex | 7d33d97d |
2100550013 has 2 divisors, whose sum is σ = 2100550014. Its totient is φ = 2100550012.
The previous prime is 2100549947. The next prime is 2100550033. The reversal of 2100550013 is 3100550012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1494750244 + 605799769 = 38662^2 + 24613^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100550013 - 28 = 2100549757 is a prime.
It is a super-2 number, since 2×21005500132 = 8824620714228600338, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2100549973 and 2100550000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100550033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050275006 + 1050275007.
It is an arithmetic number, because the mean of its divisors is an integer number (1050275007).
Almost surely, 22100550013 is an apocalyptic number.
It is an amenable number.
2100550013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100550013 is an equidigital number, since it uses as much as digits as its factorization.
2100550013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 2100550013 is about 45831.7576904923. The cubic root of 2100550013 is about 1280.6909544647.
Subtracting 2100550013 from its reverse (3100550012), we obtain a palindrome (999999999).
The spelling of 2100550013 in words is "two billion, one hundred million, five hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •