Base | Representation |
---|---|
bin | 11110100111110110010… |
… | …010101110000101101101 |
3 | 21110011202020111121020010 |
4 | 132213312102232011231 |
5 | 233434223001012003 |
6 | 4250422412043433 |
7 | 305015164206156 |
oct | 36476622560555 |
9 | 7404666447203 |
10 | 2104371110253 |
11 | 7415056a37a5 |
12 | 29ba11763579 |
13 | 123597830289 |
14 | 73bd026892d |
15 | 39b15d46003 |
hex | 1e9f64ae16d |
2104371110253 has 8 divisors (see below), whose sum is σ = 2817470588416. Its totient is φ = 1397092852800.
The previous prime is 2104371110251. The next prime is 2104371110267. The reversal of 2104371110253 is 3520111734012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2104371110253 - 21 = 2104371110251 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2104371110253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2104371110251) 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, 1455304333 + ... + 1455305778.
It is an arithmetic number, because the mean of its divisors is an integer number (352183823552).
Almost surely, 22104371110253 is an apocalyptic number.
It is an amenable number.
2104371110253 is a deficient number, since it is larger than the sum of its proper divisors (713099478163).
2104371110253 is a wasteful number, since it uses less digits than its factorization.
2104371110253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2910610355.
The product of its (nonzero) digits is 5040, while the sum is 30.
Adding to 2104371110253 its reverse (3520111734012), we get a palindrome (5624482844265).
The spelling of 2104371110253 in words is "two trillion, one hundred four billion, three hundred seventy-one million, one hundred ten thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •