Base | Representation |
---|---|
bin | 11110100111111001001… |
… | …101010001100000010101 |
3 | 21110011212122112011200202 |
4 | 132213321031101200111 |
5 | 233434323010422401 |
6 | 4250431320150245 |
7 | 305016326660036 |
oct | 36477115214025 |
9 | 7404778464622 |
10 | 2104420014101 |
11 | 7415302659a9 |
12 | 29ba26008385 |
13 | 1235a49c3772 |
14 | 73bd6958a8d |
15 | 39b1a2a606b |
hex | 1e9f9351815 |
2104420014101 has 8 divisors (see below), whose sum is σ = 2112506318520. Its totient is φ = 2096335659712.
The previous prime is 2104420014041. The next prime is 2104420014121. The reversal of 2104420014101 is 1014100244012.
It can be written as a sum of positive squares in 4 ways, for example, as 164388891601 + 1940031122500 = 405449^2 + 1392850^2 .
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 2104420014101 - 210 = 2104420013077 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 (2104420014121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1693691 + ... + 2660343.
It is an arithmetic number, because the mean of its divisors is an integer number (264063289815).
Almost surely, 22104420014101 is an apocalyptic number.
It is an amenable number.
2104420014101 is a deficient number, since it is larger than the sum of its proper divisors (8086304419).
2104420014101 is an equidigital number, since it uses as much as digits as its factorization.
2104420014101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 975015.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 2104420014101 its reverse (1014100244012), we get a palindrome (3118520258113).
The spelling of 2104420014101 in words is "two trillion, one hundred four billion, four hundred twenty million, fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •