Base | Representation |
---|---|
bin | 1001011110111001111101… |
… | …1110001101010000010001 |
3 | 1100220202202222020111021021 |
4 | 2113232133132031100101 |
5 | 2331312044121421340 |
6 | 34101521314155441 |
7 | 2124202622150563 |
oct | 227563736152021 |
9 | 40822688214237 |
10 | 10426561123345 |
11 | 335a974a30524 |
12 | 12048a2282b81 |
13 | 5a82b35736a3 |
14 | 280910b2d333 |
15 | 1313435cde4a |
hex | 97b9f78d411 |
10426561123345 has 16 divisors (see below), whose sum is σ = 12748150496592. Its totient is φ = 8183735838720.
The previous prime is 10426561123333. The next prime is 10426561123357. The reversal of 10426561123345 is 54332116562401.
It is an interprime number because it is at equal distance from previous prime (10426561123333) and next prime (10426561123357).
It can be written as a sum of positive squares in 8 ways, for example, as 4641232539904 + 5785328583441 = 2154352^2 + 2405271^2 .
It is not a de Polignac number, because 10426561123345 - 25 = 10426561123313 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18355309 + ... + 18914821.
It is an arithmetic number, because the mean of its divisors is an integer number (796759406037).
Almost surely, 210426561123345 is an apocalyptic number.
It is an amenable number.
10426561123345 is a deficient number, since it is larger than the sum of its proper divisors (2321589373247).
10426561123345 is an equidigital number, since it uses as much as digits as its factorization.
10426561123345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 629892.
The product of its (nonzero) digits is 518400, while the sum is 43.
Adding to 10426561123345 its reverse (54332116562401), we get a palindrome (64758677685746).
The spelling of 10426561123345 in words is "ten trillion, four hundred twenty-six billion, five hundred sixty-one million, one hundred twenty-three thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •