Base | Representation |
---|---|
bin | 1001011110101001101110… |
… | …1001111101111110100101 |
3 | 1100220100112012000200222221 |
4 | 2113222123221331332211 |
5 | 2331224132221132331 |
6 | 34055521001552341 |
7 | 2123656612263301 |
oct | 227523351757645 |
9 | 40810465020887 |
10 | 10422202130341 |
11 | 335903843a571 |
12 | 1203a864a56b1 |
13 | 5a7a6a46a6a1 |
14 | 280619c4ad01 |
15 | 13118aa95711 |
hex | 97a9ba7dfa5 |
10422202130341 has 2 divisors, whose sum is σ = 10422202130342. Its totient is φ = 10422202130340.
The previous prime is 10422202130321. The next prime is 10422202130399. The reversal of 10422202130341 is 14303120222401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9713482289316 + 708719841025 = 3116646^2 + 841855^2 .
It is a cyclic number.
It is not a de Polignac number, because 10422202130341 - 217 = 10422201999269 is a prime.
It is a super-3 number, since 3×104222021303413 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10422202130321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5211101065170 + 5211101065171.
It is an arithmetic number, because the mean of its divisors is an integer number (5211101065171).
Almost surely, 210422202130341 is an apocalyptic number.
It is an amenable number.
10422202130341 is a deficient number, since it is larger than the sum of its proper divisors (1).
10422202130341 is an equidigital number, since it uses as much as digits as its factorization.
10422202130341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10422202130341 its reverse (14303120222401), we get a palindrome (24725322352742).
The spelling of 10422202130341 in words is "ten trillion, four hundred twenty-two billion, two hundred two million, one hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •