Base | Representation |
---|---|
bin | 11101010000010110011… |
… | …011111011011000110101 |
3 | 21010012020201000022110212 |
4 | 131100112123323120311 |
5 | 230414320301130141 |
6 | 4135324045355205 |
7 | 265151052341606 |
oct | 35202633733065 |
9 | 7105221008425 |
10 | 2010421114421 |
11 | 705684342345 |
12 | 285771b68b05 |
13 | 117774576875 |
14 | 6d43a911dad |
15 | 37467d202eb |
hex | 1d4166fb635 |
2010421114421 has 8 divisors (see below), whose sum is σ = 2053758235680. Its totient is φ = 1967284165392.
The previous prime is 2010421114391. The next prime is 2010421114441. The reversal of 2010421114421 is 1244111240102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2010421114421 - 222 = 2010416920117 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 (2010421114441) 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, 50022755 + ... + 50062928.
It is an arithmetic number, because the mean of its divisors is an integer number (256719779460).
Almost surely, 22010421114421 is an apocalyptic number.
It is an amenable number.
2010421114421 is a deficient number, since it is larger than the sum of its proper divisors (43337121259).
2010421114421 is a wasteful number, since it uses less digits than its factorization.
2010421114421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100086115.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 2010421114421 its reverse (1244111240102), we get a palindrome (3254532354523).
The spelling of 2010421114421 in words is "two trillion, ten billion, four hundred twenty-one million, one hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •