Base | Representation |
---|---|
bin | 1001011110000100111011… |
… | …1111110001010011001001 |
3 | 1100212102000220110121202012 |
4 | 2113201032333301103021 |
5 | 2331043420433042403 |
6 | 34051205003345305 |
7 | 2123160101152022 |
oct | 227411677612311 |
9 | 40772026417665 |
10 | 10412326065353 |
11 | 335492a684793 |
12 | 1201b8ab22235 |
13 | 5a6b55354254 |
14 | 27dd60349c49 |
15 | 130cada18ed8 |
hex | 9784eff14c9 |
10412326065353 has 2 divisors, whose sum is σ = 10412326065354. Its totient is φ = 10412326065352.
The previous prime is 10412326065329. The next prime is 10412326065457. The reversal of 10412326065353 is 35356062321401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10194565709449 + 217760355904 = 3192893^2 + 466648^2 .
It is a cyclic number.
It is not a de Polignac number, because 10412326065353 - 220 = 10412325016777 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10412326065353.
It is not a weakly prime, because it can be changed into another prime (10412326065313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5206163032676 + 5206163032677.
It is an arithmetic number, because the mean of its divisors is an integer number (5206163032677).
Almost surely, 210412326065353 is an apocalyptic number.
It is an amenable number.
10412326065353 is a deficient number, since it is larger than the sum of its proper divisors (1).
10412326065353 is an equidigital number, since it uses as much as digits as its factorization.
10412326065353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 388800, while the sum is 41.
Adding to 10412326065353 its reverse (35356062321401), we get a palindrome (45768388386754).
The spelling of 10412326065353 in words is "ten trillion, four hundred twelve billion, three hundred twenty-six million, sixty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •