Base | Representation |
---|---|
bin | 10010001100010… |
… | …101011000111001 |
3 | 210021022221112220 |
4 | 102030111120321 |
5 | 1111114120400 |
6 | 50141554253 |
7 | 10364232426 |
oct | 2214253071 |
9 | 707287486 |
10 | 305223225 |
11 | 1473217aa |
12 | 86275989 |
13 | 4b309378 |
14 | 2c772d4d |
15 | 1bbe17a0 |
hex | 12315639 |
305223225 has 48 divisors (see below), whose sum is σ = 535680000. Its totient is φ = 153017920.
The previous prime is 305223211. The next prime is 305223227. The reversal of 305223225 is 522322503.
It is not a de Polignac number, because 305223225 - 24 = 305223209 is a prime.
It is a super-2 number, since 2×3052232252 = 186322434158801250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 305223195 and 305223204.
It is not an unprimeable number, because it can be changed into a prime (305223227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 100276 + ... + 103274.
It is an arithmetic number, because the mean of its divisors is an integer number (11160000).
Almost surely, 2305223225 is an apocalyptic number.
It is an amenable number.
305223225 is a deficient number, since it is larger than the sum of its proper divisors (230456775).
305223225 is a wasteful number, since it uses less digits than its factorization.
305223225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3094 (or 3089 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 24.
The square root of 305223225 is about 17470.6389408058. The cubic root of 305223225 is about 673.2957280297.
Adding to 305223225 its reverse (522322503), we get a palindrome (827545728).
The spelling of 305223225 in words is "three hundred five million, two hundred twenty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •