Base | Representation |
---|---|
bin | 111110100101110… |
… | …1000110111110001 |
3 | 12102100220100220001 |
4 | 1331023220313301 |
5 | 13300122443433 |
6 | 544222350001 |
7 | 103021300540 |
oct | 17513506761 |
9 | 5370810801 |
10 | 2100202993 |
11 | 988567659 |
12 | 4a742b301 |
13 | 27615c385 |
14 | 15cd00157 |
15 | c45a757d |
hex | 7d2e8df1 |
2100202993 has 4 divisors (see below), whose sum is σ = 2400232000. Its totient is φ = 1800173988.
The previous prime is 2100202987. The next prime is 2100203009. The reversal of 2100202993 is 3992020012.
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 2100202993 - 25 = 2100202961 is a prime.
It is a super-2 number, since 2×21002029932 = 8821705223612316098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2100202903) 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, 150014493 + ... + 150014506.
It is an arithmetic number, because the mean of its divisors is an integer number (600058000).
Almost surely, 22100202993 is an apocalyptic number.
It is an amenable number.
2100202993 is a deficient number, since it is larger than the sum of its proper divisors (300029007).
2100202993 is an equidigital number, since it uses as much as digits as its factorization.
2100202993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300029006.
The product of its (nonzero) digits is 1944, while the sum is 28.
The square root of 2100202993 is about 45827.9717312473. The cubic root of 2100202993 is about 1280.6204253416.
The spelling of 2100202993 in words is "two billion, one hundred million, two hundred two thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •