Base | Representation |
---|---|
bin | 11010110101011… |
… | …00101001101111 |
3 | 120200120101111200 |
4 | 31122230221233 |
5 | 430111234242 |
6 | 34200420543 |
7 | 5402224233 |
oct | 1532545157 |
9 | 520511450 |
10 | 225102447 |
11 | 106078889 |
12 | 63477753 |
13 | 3783601b |
14 | 21c785c3 |
15 | 14b6704c |
hex | d6aca6f |
225102447 has 12 divisors (see below), whose sum is σ = 329728464. Its totient is φ = 147954240.
The previous prime is 225102433. The next prime is 225102499. The reversal of 225102447 is 744201522.
It is not a de Polignac number, because 225102447 - 210 = 225101423 is a prime.
It is a super-2 number, since 2×2251024472 = 101342223290775618, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 225102447.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225102347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 175498 + ... + 176775.
It is an arithmetic number, because the mean of its divisors is an integer number (27477372).
Almost surely, 2225102447 is an apocalyptic number.
225102447 is a deficient number, since it is larger than the sum of its proper divisors (104626017).
225102447 is a wasteful number, since it uses less digits than its factorization.
225102447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352350 (or 352347 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 27.
The square root of 225102447 is about 15003.4145113704. The cubic root of 225102447 is about 608.3124971575.
Adding to 225102447 its reverse (744201522), we get a palindrome (969303969).
The spelling of 225102447 in words is "two hundred twenty-five million, one hundred two thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •