Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0011000010000010010101 |
3 | 1101200200200222220221122202 |
4 | 2122322110303002002111 |
5 | 2343403312343141031 |
6 | 34350235122334245 |
7 | 2146051364415230 |
oct | 232722463020225 |
9 | 41620628827582 |
10 | 10645425365141 |
11 | 34347771027a6 |
12 | 123b1a34ba385 |
13 | 5c2b22b798c8 |
14 | 28b35432a417 |
15 | 136da2c232cb |
hex | 9ae94cc2095 |
10645425365141 has 16 divisors (see below), whose sum is σ = 12517839895680. Its totient is φ = 8862881521920.
The previous prime is 10645425365137. The next prime is 10645425365143. The reversal of 10645425365141 is 14156352454601.
It is a cyclic number.
It is not a de Polignac number, because 10645425365141 - 22 = 10645425365137 is a prime.
It is a super-2 number, since 2×106454253651412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10645425365143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81635456 + ... + 81765753.
It is an arithmetic number, because the mean of its divisors is an integer number (782364993480).
Almost surely, 210645425365141 is an apocalyptic number.
It is an amenable number.
10645425365141 is a deficient number, since it is larger than the sum of its proper divisors (1872414530539).
10645425365141 is a wasteful number, since it uses less digits than its factorization.
10645425365141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163401484.
The product of its (nonzero) digits is 1728000, while the sum is 47.
The spelling of 10645425365141 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-five million, three hundred sixty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •