Base | Representation |
---|---|
bin | 10111111100111110011110… |
… | …000001011011000010101001 |
3 | 111210222220200001201112011210 |
4 | 113330332132001123002221 |
5 | 102301434200343321100 |
6 | 1012014545201343333 |
7 | 31121643041630541 |
oct | 2774763601330251 |
9 | 453886601645153 |
10 | 105345314042025 |
11 | 30625773480442 |
12 | b994764637b49 |
13 | 46a2036023315 |
14 | 1c02a51956321 |
15 | c2a417972c50 |
hex | 5fcf9e05b0a9 |
105345314042025 has 24 divisors (see below), whose sum is σ = 174174273370144. Its totient is φ = 56183085504000.
The previous prime is 105345314041951. The next prime is 105345314042027. The reversal of 105345314042025 is 520240413543501.
It is not a de Polignac number, because 105345314042025 - 28 = 105345314041769 is a prime.
It is a super-2 number, since 2×1053453140420252 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105345314042027) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9596776 + ... + 17400825.
Almost surely, 2105345314042025 is an apocalyptic number.
105345314042025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105345314042025 is a deficient number, since it is larger than the sum of its proper divisors (68828959328119).
105345314042025 is a wasteful number, since it uses less digits than its factorization.
105345314042025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27049641 (or 27049636 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 39.
Adding to 105345314042025 its reverse (520240413543501), we get a palindrome (625585727585526).
The spelling of 105345314042025 in words is "one hundred five trillion, three hundred forty-five billion, three hundred fourteen million, forty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •