Base | Representation |
---|---|
bin | 1001011001111100000001… |
… | …1000110010001111100101 |
3 | 1100121121110222120121202101 |
4 | 2112133000120302033211 |
5 | 2323412301241113242 |
6 | 33554404345212101 |
7 | 2115061631463406 |
oct | 226370030621745 |
9 | 40547428517671 |
10 | 10341214004197 |
11 | 332775878a70a |
12 | 11b0243791031 |
13 | 5a02316c515b |
14 | 27a735b759ad |
15 | 12deea98d9b7 |
hex | 967c06323e5 |
10341214004197 has 2 divisors, whose sum is σ = 10341214004198. Its totient is φ = 10341214004196.
The previous prime is 10341214004161. The next prime is 10341214004243. The reversal of 10341214004197 is 79140041214301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9249542185636 + 1091671818561 = 3041306^2 + 1044831^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10341214004197 is a prime.
It is a super-2 number, since 2×103412140041972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10341214005197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5170607002098 + 5170607002099.
It is an arithmetic number, because the mean of its divisors is an integer number (5170607002099).
Almost surely, 210341214004197 is an apocalyptic number.
It is an amenable number.
10341214004197 is a deficient number, since it is larger than the sum of its proper divisors (1).
10341214004197 is an equidigital number, since it uses as much as digits as its factorization.
10341214004197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 37.
Adding to 10341214004197 its reverse (79140041214301), we get a palindrome (89481255218498).
The spelling of 10341214004197 in words is "ten trillion, three hundred forty-one billion, two hundred fourteen million, four thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •