Base | Representation |
---|---|
bin | 1001011010000001000000… |
… | …1101100100111010110011 |
3 | 1100121201221022121000110012 |
4 | 2112200100031210322303 |
5 | 2323423022112241230 |
6 | 33555145305525135 |
7 | 2115140053022546 |
oct | 226402015447263 |
9 | 40551838530405 |
10 | 10342553243315 |
11 | 33282857488a7 |
12 | 11b05581a37ab |
13 | 5a03b5cbb537 |
14 | 27a82198c85d |
15 | 12e078330395 |
hex | 96810364eb3 |
10342553243315 has 8 divisors (see below), whose sum is σ = 12568165967040. Its totient is φ = 8169307877952.
The previous prime is 10342553243311. The next prime is 10342553243359. The reversal of 10342553243315 is 51334235524301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10342553243315 - 22 = 10342553243311 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10342553243311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13091839154 + ... + 13091839943.
It is an arithmetic number, because the mean of its divisors is an integer number (1571020745880).
Almost surely, 210342553243315 is an apocalyptic number.
10342553243315 is a deficient number, since it is larger than the sum of its proper divisors (2225612723725).
10342553243315 is an equidigital number, since it uses as much as digits as its factorization.
10342553243315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26183679181.
The product of its (nonzero) digits is 648000, while the sum is 41.
Adding to 10342553243315 its reverse (51334235524301), we get a palindrome (61676788767616).
The spelling of 10342553243315 in words is "ten trillion, three hundred forty-two billion, five hundred fifty-three million, two hundred forty-three thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •