Base | Representation |
---|---|
bin | 1001011001111011101001… |
… | …1100100110011010111101 |
3 | 1100121121020001001012121211 |
4 | 2112132322130212122331 |
5 | 2323412100232403203 |
6 | 33554350425124421 |
7 | 2115056311403326 |
oct | 226367234463275 |
9 | 40547201035554 |
10 | 10341114341053 |
11 | 33277074a9281 |
12 | 11b0216329711 |
13 | 5a0216b6ba92 |
14 | 27a72683144d |
15 | 12dee1d53c6d |
hex | 967ba7266bd |
10341114341053 has 2 divisors, whose sum is σ = 10341114341054. Its totient is φ = 10341114341052.
The previous prime is 10341114341029. The next prime is 10341114341059. The reversal of 10341114341053 is 35014341114301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6164703025924 + 4176411315129 = 2482882^2 + 2043627^2 .
It is a cyclic number.
It is not a de Polignac number, because 10341114341053 - 25 = 10341114341021 is a prime.
It is a super-2 number, since 2×103411143410532 (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 (10341114341059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5170557170526 + 5170557170527.
It is an arithmetic number, because the mean of its divisors is an integer number (5170557170527).
Almost surely, 210341114341053 is an apocalyptic number.
It is an amenable number.
10341114341053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10341114341053 is an equidigital number, since it uses as much as digits as its factorization.
10341114341053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 10341114341053 its reverse (35014341114301), we get a palindrome (45355455455354).
The spelling of 10341114341053 in words is "ten trillion, three hundred forty-one billion, one hundred fourteen million, three hundred forty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •