Base | Representation |
---|---|
bin | 101011011111110100110… |
… | …101110100100000000101 |
3 | 101120202102012211222102021 |
4 | 223133310311310200011 |
5 | 342433144131120401 |
6 | 10205102253243141 |
7 | 425645634645412 |
oct | 53376465644005 |
9 | 11522365758367 |
10 | 2989110020101 |
11 | a52746753697 |
12 | 403386a934b1 |
13 | 188b44646b0a |
14 | a49608a5109 |
15 | 52b486882a1 |
hex | 2b7f4d74805 |
2989110020101 has 4 divisors (see below), whose sum is σ = 2996564160204. Its totient is φ = 2981655880000.
The previous prime is 2989110020093. The next prime is 2989110020161. The reversal of 2989110020101 is 1010200119892.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2916614996100 + 72495024001 = 1707810^2 + 269249^2 .
It is a cyclic number.
It is not a de Polignac number, because 2989110020101 - 23 = 2989110020093 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 (2989110020161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3727069450 + ... + 3727070251.
It is an arithmetic number, because the mean of its divisors is an integer number (749141040051).
Almost surely, 22989110020101 is an apocalyptic number.
It is an amenable number.
2989110020101 is a deficient number, since it is larger than the sum of its proper divisors (7454140103).
2989110020101 is an equidigital number, since it uses as much as digits as its factorization.
2989110020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7454140102.
The product of its (nonzero) digits is 2592, while the sum is 34.
Adding to 2989110020101 its reverse (1010200119892), we get a palindrome (3999310139993).
The spelling of 2989110020101 in words is "two trillion, nine hundred eighty-nine billion, one hundred ten million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •