Base | Representation |
---|---|
bin | 10011011010110010… |
… | …10111110011010001 |
3 | 222220120001020002122 |
4 | 21231121113303101 |
5 | 132322334132400 |
6 | 4442254224025 |
7 | 516230415062 |
oct | 115531276321 |
9 | 28816036078 |
10 | 10425302225 |
11 | 446a8a1958 |
12 | 202b4b5015 |
13 | ca1b4a6b0 |
14 | 70c832569 |
15 | 4103bd685 |
hex | 26d657cd1 |
10425302225 has 24 divisors (see below), whose sum is σ = 14298069240. Its totient is φ = 7490603520.
The previous prime is 10425302221. The next prime is 10425302257. The reversal of 10425302225 is 52220352401.
It can be written as a sum of positive squares in 12 ways, for example, as 3017085184 + 7408217041 = 54928^2 + 86071^2 .
It is not a de Polignac number, because 10425302225 - 22 = 10425302221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10425302194 and 10425302203.
It is not an unprimeable number, because it can be changed into a prime (10425302221) 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 23 ways as a sum of consecutive naturals, for example, 421460 + ... + 445509.
It is an arithmetic number, because the mean of its divisors is an integer number (595752885).
Almost surely, 210425302225 is an apocalyptic number.
It is an amenable number.
10425302225 is a deficient number, since it is larger than the sum of its proper divisors (3872767015).
10425302225 is a wasteful number, since it uses less digits than its factorization.
10425302225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 867029 (or 867024 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 10425302225 its reverse (52220352401), we get a palindrome (62645654626).
The spelling of 10425302225 in words is "ten billion, four hundred twenty-five million, three hundred two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •