Base | Representation |
---|---|
bin | 1001011001111100100000… |
… | …0101010101110010001001 |
3 | 1100121121210222112121200011 |
4 | 2112133020011111302021 |
5 | 2323413032314441432 |
6 | 33554425240511521 |
7 | 2115065060131651 |
oct | 226371005256211 |
9 | 40547728477604 |
10 | 10341343124617 |
11 | 33278146607aa |
12 | 11b027aa7b5a1 |
13 | 5a025239347b |
14 | 27a748d87361 |
15 | 12e006e96847 |
hex | 967c8155c89 |
10341343124617 has 2 divisors, whose sum is σ = 10341343124618. Its totient is φ = 10341343124616.
The previous prime is 10341343124573. The next prime is 10341343124627. The reversal of 10341343124617 is 71642134314301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7119099130896 + 3222243993721 = 2668164^2 + 1795061^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10341343124617 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10341343124617.
It is not a weakly prime, because it can be changed into another prime (10341343124627) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5170671562308 + 5170671562309.
It is an arithmetic number, because the mean of its divisors is an integer number (5170671562309).
Almost surely, 210341343124617 is an apocalyptic number.
It is an amenable number.
10341343124617 is a deficient number, since it is larger than the sum of its proper divisors (1).
10341343124617 is an equidigital number, since it uses as much as digits as its factorization.
10341343124617 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 145152, while the sum is 40.
Adding to 10341343124617 its reverse (71642134314301), we get a palindrome (81983477438918).
The spelling of 10341343124617 in words is "ten trillion, three hundred forty-one billion, three hundred forty-three million, one hundred twenty-four thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •