Base | Representation |
---|---|
bin | 111110110010… |
… | …110110101001 |
3 | 1010222022120000 |
4 | 332302312221 |
5 | 13203224400 |
6 | 1344453213 |
7 | 256626624 |
oct | 76626651 |
9 | 33868500 |
10 | 16461225 |
11 | 9323620 |
12 | 561a209 |
13 | 3544791 |
14 | 2286dbb |
15 | 16a2600 |
hex | fb2da9 |
16461225 has 60 divisors (see below), whose sum is σ = 33308880. Its totient is φ = 7970400.
The previous prime is 16461199. The next prime is 16461251. The reversal of 16461225 is 52216461.
16461225 is a `hidden beast` number, since 1 + 646 + 12 + 2 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (16461199) and next prime (16461251).
It is not a de Polignac number, because 16461225 - 27 = 16461097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 21906 + ... + 22644.
It is an arithmetic number, because the mean of its divisors is an integer number (555148).
Almost surely, 216461225 is an apocalyptic number.
16461225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16461225 is an abundant number, since it is smaller than the sum of its proper divisors (16847655).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16461225 is a wasteful number, since it uses less digits than its factorization.
16461225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772 (or 758 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 16461225 is about 4057.2435223930. The cubic root of 16461225 is about 254.3825893656.
Adding to 16461225 its reverse (52216461), we get a palindrome (68677686).
The spelling of 16461225 in words is "sixteen million, four hundred sixty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.620 sec. • engine limits •