Base | Representation |
---|---|
bin | 11110100101000000100… |
… | …000100111111111101111 |
3 | 21102212212200202021210212 |
4 | 132211000200213333233 |
5 | 233412001223130444 |
6 | 4245200024053035 |
7 | 304546462235003 |
oct | 36450040477757 |
9 | 7385780667725 |
10 | 2101321301999 |
11 | 740190103707 |
12 | 29b30030417b |
13 | 1231cca299ca |
14 | 739c11b8703 |
15 | 399d821419e |
hex | 1e940827fef |
2101321301999 has 4 divisors (see below), whose sum is σ = 2169105860160. Its totient is φ = 2033536743840.
The previous prime is 2101321301899. The next prime is 2101321302013. The reversal of 2101321301999 is 9991031231012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2101321301999 is a prime.
It is a super-2 number, since 2×21013213019992 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101321301099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33892279034 + ... + 33892279095.
It is an arithmetic number, because the mean of its divisors is an integer number (542276465040).
Almost surely, 22101321301999 is an apocalyptic number.
2101321301999 is a deficient number, since it is larger than the sum of its proper divisors (67784558161).
2101321301999 is an equidigital number, since it uses as much as digits as its factorization.
2101321301999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67784558160.
The product of its (nonzero) digits is 26244, while the sum is 41.
The spelling of 2101321301999 in words is "two trillion, one hundred one billion, three hundred twenty-one million, three hundred one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •