Base | Representation |
---|---|
bin | 11101010000000011010… |
… | …110110111010101011111 |
3 | 21010011102101200211110220 |
4 | 131100003112313111133 |
5 | 230413141330114444 |
6 | 4135232212532423 |
7 | 265140114520662 |
oct | 35200326672537 |
9 | 7104371624426 |
10 | 2010101019999 |
11 | 70552a6936a6 |
12 | 2856a2921113 |
13 | 117723161697 |
14 | 6d40a1cb6d9 |
15 | 37449b92619 |
hex | 1d4035b755f |
2010101019999 has 8 divisors (see below), whose sum is σ = 2680993448112. Its totient is φ = 1339637969280.
The previous prime is 2010101019977. The next prime is 2010101020009. The reversal of 2010101019999 is 9999101010102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2010101019999 - 217 = 2010100888927 is a prime.
It is a super-2 number, since 2×20101010199992 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2010101019999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010101019959) 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 7 ways as a sum of consecutive naturals, for example, 107333424 + ... + 107352149.
It is an arithmetic number, because the mean of its divisors is an integer number (335124181014).
Almost surely, 22010101019999 is an apocalyptic number.
2010101019999 is a deficient number, since it is larger than the sum of its proper divisors (670892428113).
2010101019999 is a wasteful number, since it uses less digits than its factorization.
2010101019999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214688697.
The product of its (nonzero) digits is 13122, while the sum is 42.
The spelling of 2010101019999 in words is "two trillion, ten billion, one hundred one million, nineteen thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •