Base | Representation |
---|---|
bin | 1001010101001110010100… |
… | …1100110011101011110101 |
3 | 1100022212102212200212111211 |
4 | 2111103211030303223311 |
5 | 2321100421133231431 |
6 | 33453252222001421 |
7 | 2106163665406300 |
oct | 225234514635365 |
9 | 40285385625454 |
10 | 10260227242741 |
11 | 32a63798820a3 |
12 | 1198601416271 |
13 | 5956c6009b28 |
14 | 276851d37b37 |
15 | 12bd5aa562b1 |
hex | 954e5333af5 |
10260227242741 has 24 divisors (see below), whose sum is σ = 12265318440960. Its totient is φ = 8551643923872.
The previous prime is 10260227242703. The next prime is 10260227242751. The reversal of 10260227242741 is 14724272206201.
It is a happy number.
It is not a de Polignac number, because 10260227242741 - 213 = 10260227234549 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10260227242694 and 10260227242703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10260227242751) 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, 1313500 + ... + 4716538.
It is an arithmetic number, because the mean of its divisors is an integer number (511054935040).
Almost surely, 210260227242741 is an apocalyptic number.
It is an amenable number.
10260227242741 is a deficient number, since it is larger than the sum of its proper divisors (2005091198219).
10260227242741 is a wasteful number, since it uses less digits than its factorization.
10260227242741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3404753 (or 3404746 counting only the distinct ones).
The product of its (nonzero) digits is 150528, while the sum is 40.
Adding to 10260227242741 its reverse (14724272206201), we get a palindrome (24984499448942).
The spelling of 10260227242741 in words is "ten trillion, two hundred sixty billion, two hundred twenty-seven million, two hundred forty-two thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •