Base | Representation |
---|---|
bin | 1001011101101010100010… |
… | …1010100110010100010001 |
3 | 1100211201202002210010210001 |
4 | 2113122220222212110101 |
5 | 2330434413033431233 |
6 | 34044033532010001 |
7 | 2122516363124065 |
oct | 227325052462421 |
9 | 40751662703701 |
10 | 10405240530193 |
11 | 3351924019303 |
12 | 1200732000901 |
13 | 5a62964006b2 |
14 | 27d88b2c5aa5 |
15 | 1309e695627d |
hex | 976a8aa6511 |
10405240530193 has 2 divisors, whose sum is σ = 10405240530194. Its totient is φ = 10405240530192.
The previous prime is 10405240530131. The next prime is 10405240530203. The reversal of 10405240530193 is 39103504250401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10215617731344 + 189622798849 = 3196188^2 + 435457^2 .
It is a cyclic number.
It is not a de Polignac number, because 10405240530193 - 221 = 10405238433041 is a prime.
It is a super-2 number, since 2×104052405301932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10405240530793) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5202620265096 + 5202620265097.
It is an arithmetic number, because the mean of its divisors is an integer number (5202620265097).
Almost surely, 210405240530193 is an apocalyptic number.
It is an amenable number.
10405240530193 is a deficient number, since it is larger than the sum of its proper divisors (1).
10405240530193 is an equidigital number, since it uses as much as digits as its factorization.
10405240530193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 10405240530193 its reverse (39103504250401), we get a palindrome (49508744780594).
The spelling of 10405240530193 in words is "ten trillion, four hundred five billion, two hundred forty million, five hundred thirty thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •