Base | Representation |
---|---|
bin | 10011001100001110… |
… | …10011011101001101 |
3 | 222121001010222220021 |
4 | 21212013103131031 |
5 | 132100100002300 |
6 | 4422211422141 |
7 | 513215056153 |
oct | 114607233515 |
9 | 28531128807 |
10 | 10303125325 |
11 | 4407933609 |
12 | 1bb65b4951 |
13 | c8274097c |
14 | 6da50b3d3 |
15 | 4047d7d1a |
hex | 2661d374d |
10303125325 has 6 divisors (see below), whose sum is σ = 12775875434. Its totient is φ = 8242500240.
The previous prime is 10303125293. The next prime is 10303125331. The reversal of 10303125325 is 52352130301.
It can be written as a sum of positive squares in 3 ways, for example, as 923977609 + 9379147716 = 30397^2 + 96846^2 .
It is not a de Polignac number, because 10303125325 - 25 = 10303125293 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25), and also a Moran number because the ratio is a prime number: 412125013 = 10303125325 / (1 + 0 + 3 + 0 + 3 + 1 + 2 + 5 + 3 + 2 + 5).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10303125325.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 206062482 + ... + 206062531.
Almost surely, 210303125325 is an apocalyptic number.
It is an amenable number.
10303125325 is a deficient number, since it is larger than the sum of its proper divisors (2472750109).
10303125325 is an equidigital number, since it uses as much as digits as its factorization.
10303125325 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 412125023 (or 412125018 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 10303125325 its reverse (52352130301), we get a palindrome (62655255626).
The spelling of 10303125325 in words is "ten billion, three hundred three million, one hundred twenty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •