Base | Representation |
---|---|
bin | 111110101001010… |
… | …0100101111101101 |
3 | 12102111022201212101 |
4 | 1331102210233231 |
5 | 13301104133401 |
6 | 544325335101 |
7 | 103042612255 |
oct | 17522445755 |
9 | 5374281771 |
10 | 2102021101 |
11 | 989599624 |
12 | 4a7b67491 |
13 | 276647a8b |
14 | 15d254965 |
15 | c4816101 |
hex | 7d4a4bed |
2102021101 has 4 divisors (see below), whose sum is σ = 2131627104. Its totient is φ = 2072415100.
The previous prime is 2102021081. The next prime is 2102021107. The reversal of 2102021101 is 1011202012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2102021101 - 215 = 2101988333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102021107) 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 in 3 ways as a sum of consecutive naturals, for example, 14802895 + ... + 14803036.
It is an arithmetic number, because the mean of its divisors is an integer number (532906776).
Almost surely, 22102021101 is an apocalyptic number.
It is an amenable number.
2102021101 is a deficient number, since it is larger than the sum of its proper divisors (29606003).
2102021101 is an equidigital number, since it uses as much as digits as its factorization.
2102021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29606002.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2102021101 is about 45847.8036660427. The cubic root of 2102021101 is about 1280.9898554576.
Adding to 2102021101 its reverse (1011202012), we get a palindrome (3113223113).
The spelling of 2102021101 in words is "two billion, one hundred two million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •