Base | Representation |
---|---|
bin | 1000000011011111… |
… | …0011001000011101 |
3 | 12120200101121201101 |
4 | 2000313303020131 |
5 | 13412000023010 |
6 | 554313313101 |
7 | 104402432425 |
oct | 20067631035 |
9 | 5520347641 |
10 | 2162111005 |
11 | a0a500aaa |
12 | 504105791 |
13 | 285c26932 |
14 | 167217485 |
15 | c9c3573a |
hex | 80df321d |
2162111005 has 4 divisors (see below), whose sum is σ = 2594533212. Its totient is φ = 1729688800.
The previous prime is 2162110987. The next prime is 2162111053. The reversal of 2162111005 is 5001112612.
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 1247290489 + 914820516 = 35317^2 + 30246^2 .
It is not a de Polignac number, because 2162111005 - 27 = 2162110877 is a prime.
It is a super-4 number, since 4×21621110054 (a number of 38 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent 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, 216211096 + ... + 216211105.
It is an arithmetic number, because the mean of its divisors is an integer number (648633303).
Almost surely, 22162111005 is an apocalyptic number.
It is an amenable number.
2162111005 is a deficient number, since it is larger than the sum of its proper divisors (432422207).
2162111005 is an equidigital number, since it uses as much as digits as its factorization.
2162111005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432422206.
The product of its (nonzero) digits is 120, while the sum is 19.
The square root of 2162111005 is about 46498.5054060881. The cubic root of 2162111005 is about 1293.0817900920.
Adding to 2162111005 its reverse (5001112612), we get a palindrome (7163223617).
The spelling of 2162111005 in words is "two billion, one hundred sixty-two million, one hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •