Base | Representation |
---|---|
bin | 1001010010011001001011… |
… | …0010111111110000000101 |
3 | 1100011012220222011022010001 |
4 | 2110212102302333300011 |
5 | 2314301324111320303 |
6 | 33415051101401301 |
7 | 2102522653506646 |
oct | 224462262776005 |
9 | 40135828138101 |
10 | 10211600104453 |
11 | 3287796052400 |
12 | 118b0b0269231 |
13 | 590c46806317 |
14 | 27435ba936cd |
15 | 12a96199531d |
hex | 94992cbfc05 |
10211600104453 has 12 divisors (see below), whose sum is σ = 11224405089324. Its totient is φ = 9283203089600.
The previous prime is 10211600104379. The next prime is 10211600104487. The reversal of 10211600104453 is 35440100611201.
It can be written as a sum of positive squares in 2 ways, for example, as 2528713777249 + 7682886327204 = 1590193^2 + 2771802^2 .
It is a de Polignac number, because none of the positive numbers 2k-10211600104453 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 (10211600104253) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22790025 + ... + 23233777.
It is an arithmetic number, because the mean of its divisors is an integer number (935367090777).
Almost surely, 210211600104453 is an apocalyptic number.
It is an amenable number.
10211600104453 is a deficient number, since it is larger than the sum of its proper divisors (1012804984871).
10211600104453 is a wasteful number, since it uses less digits than its factorization.
10211600104453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633956 (or 633945 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 10211600104453 its reverse (35440100611201), we get a palindrome (45651700715654).
The spelling of 10211600104453 in words is "ten trillion, two hundred eleven billion, six hundred million, one hundred four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •