Base | Representation |
---|---|
bin | 100100100001000… |
… | …1001100001010101 |
3 | 10011101121200200110 |
4 | 1021002021201111 |
5 | 10002134100203 |
6 | 321330233233 |
7 | 42235610235 |
oct | 11102114125 |
9 | 3141550613 |
10 | 1225300053 |
11 | 57971707a |
12 | 2a2425819 |
13 | 166b12123 |
14 | b8a37cc5 |
15 | 72886d03 |
hex | 49089855 |
1225300053 has 4 divisors (see below), whose sum is σ = 1633733408. Its totient is φ = 816866700.
The previous prime is 1225300003. The next prime is 1225300081. The reversal of 1225300053 is 3500035221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1225300053 - 212 = 1225295957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1225300003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 204216673 + ... + 204216678.
It is an arithmetic number, because the mean of its divisors is an integer number (408433352).
Almost surely, 21225300053 is an apocalyptic number.
It is an amenable number.
1225300053 is a deficient number, since it is larger than the sum of its proper divisors (408433355).
1225300053 is an equidigital number, since it uses as much as digits as its factorization.
1225300053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408433354.
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 1225300053 is about 35004.2862089773. The cubic root of 1225300053 is about 1070.0748347811.
Adding to 1225300053 its reverse (3500035221), we get a palindrome (4725335274).
The spelling of 1225300053 in words is "one billion, two hundred twenty-five million, three hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •