Base | Representation |
---|---|
bin | 100100100000100… |
… | …1111101101010101 |
3 | 10011101011122212002 |
4 | 1021001033231111 |
5 | 10002104011003 |
6 | 321321205045 |
7 | 42233602661 |
oct | 11101175525 |
9 | 3141148762 |
10 | 1225063253 |
11 | 579575177 |
12 | 2a2330785 |
13 | 166a5b3cb |
14 | b89b58a1 |
15 | 7283ba88 |
hex | 4904fb55 |
1225063253 has 4 divisors (see below), whose sum is σ = 1248177708. Its totient is φ = 1201948800.
The previous prime is 1225063243. The next prime is 1225063261. The reversal of 1225063253 is 3523605221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 296459524 + 928603729 = 17218^2 + 30473^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1225063253 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1225063243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11557148 + ... + 11557253.
It is an arithmetic number, because the mean of its divisors is an integer number (312044427).
Almost surely, 21225063253 is an apocalyptic number.
It is an amenable number.
1225063253 is a deficient number, since it is larger than the sum of its proper divisors (23114455).
1225063253 is an equidigital number, since it uses as much as digits as its factorization.
1225063253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23114454.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 1225063253 is about 35000.9036026215. The cubic root of 1225063253 is about 1070.0058965524.
Adding to 1225063253 its reverse (3523605221), we get a palindrome (4748668474).
The spelling of 1225063253 in words is "one billion, two hundred twenty-five million, sixty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •