Base | Representation |
---|---|
bin | 1001011001111101010000… |
… | …0010001100011010000001 |
3 | 1100121122022221211011100222 |
4 | 2112133110002030122001 |
5 | 2323413440132020434 |
6 | 33554501202152425 |
7 | 2115103043306114 |
oct | 226372402143201 |
9 | 40548287734328 |
10 | 10341543626369 |
11 | 332790785672a |
12 | 11b0316052715 |
13 | 5a0284a94c67 |
14 | 27a76785a57b |
15 | 12e01989e72e |
hex | 967d408c681 |
10341543626369 has 2 divisors, whose sum is σ = 10341543626370. Its totient is φ = 10341543626368.
The previous prime is 10341543626303. The next prime is 10341543626377. The reversal of 10341543626369 is 96362634514301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10097395969600 + 244147656769 = 3177640^2 + 494113^2 .
It is a cyclic number.
It is not a de Polignac number, because 10341543626369 - 240 = 9242031998593 is a prime.
It is a super-2 number, since 2×103415436263692 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10341543626369.
It is not a weakly prime, because it can be changed into another prime (10341543626569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5170771813184 + 5170771813185.
It is an arithmetic number, because the mean of its divisors is an integer number (5170771813185).
Almost surely, 210341543626369 is an apocalyptic number.
It is an amenable number.
10341543626369 is a deficient number, since it is larger than the sum of its proper divisors (1).
10341543626369 is an equidigital number, since it uses as much as digits as its factorization.
10341543626369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8398080, while the sum is 53.
The spelling of 10341543626369 in words is "ten trillion, three hundred forty-one billion, five hundred forty-three million, six hundred twenty-six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •