Base | Representation |
---|---|
bin | 10001110101010111010… |
… | …011001011011010010001 |
3 | 11100011022022111222102011 |
4 | 101311113103023122101 |
5 | 130034341230342000 |
6 | 2335000104022521 |
7 | 154353532611235 |
oct | 21652723133221 |
9 | 4304268458364 |
10 | 1225530324625 |
11 | 432820a11932 |
12 | 179623761a41 |
13 | 8b74a962c79 |
14 | 4345d0bc5c5 |
15 | 21d2b2162ba |
hex | 11d574cb691 |
1225530324625 has 8 divisors (see below), whose sum is σ = 1529461845288. Its totient is φ = 980424259600.
The previous prime is 1225530324619. The next prime is 1225530324631. The reversal of 1225530324625 is 5264230355221.
It is an interprime number because it is at equal distance from previous prime (1225530324619) and next prime (1225530324631).
It can be written as a sum of positive squares in 4 ways, for example, as 1336341136 + 1224193983489 = 36556^2 + 1106433^2 .
It is not a de Polignac number, because 1225530324625 - 27 = 1225530324497 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4902121174 + ... + 4902121423.
It is an arithmetic number, because the mean of its divisors is an integer number (191182730661).
Almost surely, 21225530324625 is an apocalyptic number.
It is an amenable number.
1225530324625 is a deficient number, since it is larger than the sum of its proper divisors (303931520663).
1225530324625 is an frugal number, since it uses more digits than its factorization.
1225530324625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9804242612 (or 9804242602 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 40.
Adding to 1225530324625 its reverse (5264230355221), we get a palindrome (6489760679846).
The spelling of 1225530324625 in words is "one trillion, two hundred twenty-five billion, five hundred thirty million, three hundred twenty-four thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •