Base | Representation |
---|---|
bin | 1001011010100000101011… |
… | …0011101011110011110001 |
3 | 1100122112212122110012200021 |
4 | 2112220022303223303301 |
5 | 2324042423420114210 |
6 | 34003112522323441 |
7 | 2115560505401242 |
oct | 226501263536361 |
9 | 40575778405607 |
10 | 10351052504305 |
11 | 3330947318437 |
12 | 11b212a659581 |
13 | 5a113bab8256 |
14 | 27adca698cc9 |
15 | 12e3c4599bda |
hex | 96a0acebcf1 |
10351052504305 has 24 divisors (see below), whose sum is σ = 12603560162040. Its totient is φ = 8161042498560.
The previous prime is 10351052504251. The next prime is 10351052504329. The reversal of 10351052504305 is 50340525015301.
It can be written as a sum of positive squares in 12 ways, for example, as 20375849536 + 10330676654769 = 142744^2 + 3214137^2 .
It is a de Polignac number, because none of the positive numbers 2k-10351052504305 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34194715 + ... + 34496095.
It is an arithmetic number, because the mean of its divisors is an integer number (525148340085).
Almost surely, 210351052504305 is an apocalyptic number.
It is an amenable number.
10351052504305 is a deficient number, since it is larger than the sum of its proper divisors (2252507657735).
10351052504305 is an equidigital number, since it uses as much as digits as its factorization.
10351052504305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302821 (or 302748 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 34.
Adding to 10351052504305 its reverse (50340525015301), we get a palindrome (60691577519606).
The spelling of 10351052504305 in words is "ten trillion, three hundred fifty-one billion, fifty-two million, five hundred four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •