Base | Representation |
---|---|
bin | 10011011001100110… |
… | …01110011010110101 |
3 | 222212212020011210222 |
4 | 21230303032122311 |
5 | 132312304133300 |
6 | 4441300024125 |
7 | 516046415621 |
oct | 115463163265 |
9 | 28785204728 |
10 | 10415302325 |
11 | 446519187a |
12 | 2028092045 |
13 | c9ca58bac |
14 | 70b38c181 |
15 | 40e595785 |
hex | 26ccce6b5 |
10415302325 has 6 divisors (see below), whose sum is σ = 12914974914. Its totient is φ = 8332241840.
The previous prime is 10415302259. The next prime is 10415302349. The reversal of 10415302325 is 52320351401.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 223592209 + 10191710116 = 14953^2 + 100954^2 .
It is not a de Polignac number, because 10415302325 - 28 = 10415302069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10415302294 and 10415302303.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 208306022 + ... + 208306071.
It is an arithmetic number, because the mean of its divisors is an integer number (2152495819).
Almost surely, 210415302325 is an apocalyptic number.
It is an amenable number.
10415302325 is a deficient number, since it is larger than the sum of its proper divisors (2499672589).
10415302325 is an equidigital number, since it uses as much as digits as its factorization.
10415302325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416612103 (or 416612098 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 10415302325 its reverse (52320351401), we get a palindrome (62735653726).
The spelling of 10415302325 in words is "ten billion, four hundred fifteen million, three hundred two thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •