Base | Representation |
---|---|
bin | 1001011110000111111100… |
… | …0011110011111100010001 |
3 | 1100212111010002210020122000 |
4 | 2113201333003303330101 |
5 | 2331102043400243441 |
6 | 34051421010504213 |
7 | 2123216062150440 |
oct | 227417703637421 |
9 | 40774102706560 |
10 | 10413132431121 |
11 | 3355203873282 |
12 | 1202174b95069 |
13 | 5a6c53425764 |
14 | 27ddd9490d57 |
15 | 130d096ec2b6 |
hex | 9787f0f3f11 |
10413132431121 has 64 divisors (see below), whose sum is σ = 17935646054400. Its totient is φ = 5847511099968.
The previous prime is 10413132431099. The next prime is 10413132431167. The reversal of 10413132431121 is 12113423131401.
10413132431121 is a `hidden beast` number, since 1 + 0 + 4 + 1 + 3 + 1 + 324 + 311 + 21 = 666.
It is not a de Polignac number, because 10413132431121 - 215 = 10413132398353 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10413132431171) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 32815606 + ... + 33131408.
It is an arithmetic number, because the mean of its divisors is an integer number (280244469600).
Almost surely, 210413132431121 is an apocalyptic number.
It is an amenable number.
10413132431121 is a deficient number, since it is larger than the sum of its proper divisors (7522513623279).
10413132431121 is a wasteful number, since it uses less digits than its factorization.
10413132431121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318835 (or 318829 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 10413132431121 its reverse (12113423131401), we get a palindrome (22526555562522).
The spelling of 10413132431121 in words is "ten trillion, four hundred thirteen billion, one hundred thirty-two million, four hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •