Base | Representation |
---|---|
bin | 111110101111011… |
… | …0001110110011001 |
3 | 12102201100021121211 |
4 | 1331132301312121 |
5 | 13302414024010 |
6 | 544522103121 |
7 | 103112036053 |
oct | 17536616631 |
9 | 5381307554 |
10 | 2105220505 |
11 | 990384363 |
12 | 4a904aaa1 |
13 | 2771c810b |
14 | 15d8488d3 |
15 | c4c4908a |
hex | 7d7b1d99 |
2105220505 has 4 divisors (see below), whose sum is σ = 2526264612. Its totient is φ = 1684176400.
The previous prime is 2105220497. The next prime is 2105220511. The reversal of 2105220505 is 5050225012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1097729424 + 1007491081 = 33132^2 + 31741^2 .
It is not a de Polignac number, because 2105220505 - 23 = 2105220497 is a prime.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 210522046 + ... + 210522055.
It is an arithmetic number, because the mean of its divisors is an integer number (631566153).
Almost surely, 22105220505 is an apocalyptic number.
It is an amenable number.
2105220505 is a deficient number, since it is larger than the sum of its proper divisors (421044107).
2105220505 is an equidigital number, since it uses as much as digits as its factorization.
2105220505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 421044106.
The product of its (nonzero) digits is 1000, while the sum is 22.
The square root of 2105220505 is about 45882.6819726136. The cubic root of 2105220505 is about 1281.6394408307.
Adding to 2105220505 its reverse (5050225012), we get a palindrome (7155445517).
The spelling of 2105220505 in words is "two billion, one hundred five million, two hundred twenty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •