Base | Representation |
---|---|
bin | 111111000000010… |
… | …1010001110111101 |
3 | 12110100001112000200 |
4 | 1332000222032331 |
5 | 13312202232310 |
6 | 545440314113 |
7 | 103250400165 |
oct | 17600521675 |
9 | 5410045020 |
10 | 2114102205 |
11 | 9953a0306 |
12 | 4b0012939 |
13 | 278cb7967 |
14 | 160abb5a5 |
15 | c59009c0 |
hex | 7e02a3bd |
2114102205 has 48 divisors (see below), whose sum is σ = 3712428720. Its totient is φ = 1112832000.
The previous prime is 2114102153. The next prime is 2114102209. The reversal of 2114102205 is 5022014112.
It can be written as a sum of positive squares in 8 ways, for example, as 2056356 + 2112045849 = 1434^2 + 45957^2 .
It is not a de Polignac number, because 2114102205 - 212 = 2114098109 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2114102209) 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 in 47 ways as a sum of consecutive naturals, for example, 2094741 + ... + 2095749.
It is an arithmetic number, because the mean of its divisors is an integer number (77342265).
Almost surely, 22114102205 is an apocalyptic number.
It is an amenable number.
2114102205 is a deficient number, since it is larger than the sum of its proper divisors (1598326515).
2114102205 is a wasteful number, since it uses less digits than its factorization.
2114102205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582 (or 1579 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 2114102205 is about 45979.3671661540. The cubic root of 2114102205 is about 1283.4392786356.
Adding to 2114102205 its reverse (5022014112), we get a palindrome (7136116317).
The spelling of 2114102205 in words is "two billion, one hundred fourteen million, one hundred two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •