Base | Representation |
---|---|
bin | 100010101011110… |
… | …0110000101101001 |
3 | 10000002220211121112 |
4 | 1011113212011221 |
5 | 4340414010400 |
6 | 311252320105 |
7 | 40561151321 |
oct | 10527460551 |
9 | 3002824545 |
10 | 1163813225 |
11 | 547a40113 |
12 | 285913035 |
13 | 1571644a3 |
14 | b07d0281 |
15 | 6c28d835 |
hex | 455e6169 |
1163813225 has 18 divisors (see below), whose sum is σ = 1508618286. Its totient is φ = 890560000.
The previous prime is 1163813197. The next prime is 1163813237. The reversal of 1163813225 is 5223183611.
It can be written as a sum of positive squares in 3 ways, for example, as 9784384 + 1154028841 = 3128^2 + 33971^2 .
It is not a de Polignac number, because 1163813225 - 210 = 1163812201 is a prime.
It is a super-2 number, since 2×11638132252 = 2708922445369801250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1163813191 and 1163813200.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 30776 + ... + 57225.
It is an arithmetic number, because the mean of its divisors is an integer number (83812127).
Almost surely, 21163813225 is an apocalyptic number.
It is an amenable number.
1163813225 is a deficient number, since it is larger than the sum of its proper divisors (344805061).
1163813225 is an equidigital number, since it uses as much as digits as its factorization.
1163813225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88057 (or 88029 counting only the distinct ones).
The product of its digits is 8640, while the sum is 32.
The square root of 1163813225 is about 34114.7068725499. The cubic root of 1163813225 is about 1051.8676435358.
Adding to 1163813225 its reverse (5223183611), we get a palindrome (6386996836).
The spelling of 1163813225 in words is "one billion, one hundred sixty-three million, eight hundred thirteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •