Base | Representation |
---|---|
bin | 111110101001010… |
… | …0010010001111001 |
3 | 12102111022020000022 |
4 | 1331102202101321 |
5 | 13301103323001 |
6 | 544325220225 |
7 | 103042540646 |
oct | 17522422171 |
9 | 5374266008 |
10 | 2102011001 |
11 | 989591a82 |
12 | 4a7b61675 |
13 | 2766432bc |
14 | 15d250dcd |
15 | c481311b |
hex | 7d4a2479 |
2102011001 has 4 divisors (see below), whose sum is σ = 2153279604. Its totient is φ = 2050742400.
The previous prime is 2102010961. The next prime is 2102011003. The reversal of 2102011001 is 1001102012.
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 701455225 + 1400555776 = 26485^2 + 37424^2 .
It is a cyclic number.
It is not a de Polignac number, because 2102011001 - 226 = 2034902137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2102011001.
It is not an unprimeable number, because it can be changed into a prime (2102011003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25634240 + ... + 25634321.
It is an arithmetic number, because the mean of its divisors is an integer number (538319901).
Almost surely, 22102011001 is an apocalyptic number.
It is an amenable number.
2102011001 is a deficient number, since it is larger than the sum of its proper divisors (51268603).
2102011001 is an equidigital number, since it uses as much as digits as its factorization.
2102011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51268602.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 2102011001 is about 45847.6935188674. The cubic root of 2102011001 is about 1280.9878037785.
Adding to 2102011001 its reverse (1001102012), we get a palindrome (3103113013).
The spelling of 2102011001 in words is "two billion, one hundred two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •