Base | Representation |
---|---|
bin | 101000100010… |
… | …000110100101 |
3 | 201222211101000 |
4 | 220202012211 |
5 | 10210003240 |
6 | 1015423513 |
7 | 156212655 |
oct | 50420645 |
9 | 21884330 |
10 | 10625445 |
11 | 5aa8066 |
12 | 3684b99 |
13 | 228045c |
14 | 15a8365 |
15 | ded430 |
hex | a221a5 |
10625445 has 16 divisors (see below), whose sum is σ = 18889920. Its totient is φ = 5666832.
The previous prime is 10625441. The next prime is 10625473. The reversal of 10625445 is 54452601.
10625445 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10625445 - 22 = 10625441 is a prime.
It is a super-2 number, since 2×106254452 = 225800162896050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10625441) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39219 + ... + 39488.
It is an arithmetic number, because the mean of its divisors is an integer number (1180620).
Almost surely, 210625445 is an apocalyptic number.
10625445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10625445 is a deficient number, since it is larger than the sum of its proper divisors (8264475).
10625445 is an equidigital number, since it uses as much as digits as its factorization.
10625445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78721 (or 78715 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 10625445 is about 3259.6694617706. The cubic root of 10625445 is about 219.8445527246.
The spelling of 10625445 in words is "ten million, six hundred twenty-five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •