Base | Representation |
---|---|
bin | 111110101010000… |
… | …1011010011111101 |
3 | 12102112010002011002 |
4 | 1331110023103331 |
5 | 13301211104323 |
6 | 544342340045 |
7 | 103046312135 |
oct | 17524132375 |
9 | 5375102132 |
10 | 2102441213 |
11 | 989856224 |
12 | 4a812a625 |
13 | 276764072 |
14 | 15d323ac5 |
15 | c489a828 |
hex | 7d50b4fd |
2102441213 has 2 divisors, whose sum is σ = 2102441214. Its totient is φ = 2102441212.
The previous prime is 2102441207. The next prime is 2102441227. The reversal of 2102441213 is 3121442012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1955231524 + 147209689 = 44218^2 + 12133^2 .
It is a cyclic number.
It is not a de Polignac number, because 2102441213 - 226 = 2035332349 is a prime.
It is a super-2 number, since 2×21024412132 = 8840518108241822738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2102441203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1051220606 + 1051220607.
It is an arithmetic number, because the mean of its divisors is an integer number (1051220607).
Almost surely, 22102441213 is an apocalyptic number.
It is an amenable number.
2102441213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2102441213 is an equidigital number, since it uses as much as digits as its factorization.
2102441213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 2102441213 is about 45852.3850306612. The cubic root of 2102441213 is about 1281.0751897360.
Adding to 2102441213 its reverse (3121442012), we get a palindrome (5223883225).
The spelling of 2102441213 in words is "two billion, one hundred two million, four hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •