Base | Representation |
---|---|
bin | 10011100101000010… |
… | …01000100110111001 |
3 | 1000010112201110112220 |
4 | 21302201020212321 |
5 | 133011333120400 |
6 | 4455003554253 |
7 | 521322631446 |
oct | 116241104671 |
9 | 30115643486 |
10 | 10511223225 |
11 | 4504347648 |
12 | 205422b989 |
13 | cb68a1b19 |
14 | 719dda9cd |
15 | 417be17a0 |
hex | 2728489b9 |
10511223225 has 24 divisors (see below), whose sum is σ = 18293219040. Its totient is φ = 5310933120.
The previous prime is 10511223221. The next prime is 10511223271. The reversal of 10511223225 is 52232211501.
It is not a de Polignac number, because 10511223225 - 22 = 10511223221 is a prime.
It is a super-2 number, since 2×105112232252 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10511223195 and 10511223204.
It is not an unprimeable number, because it can be changed into a prime (10511223221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3686724 + ... + 3689573.
It is an arithmetic number, because the mean of its divisors is an integer number (762217460).
Almost surely, 210511223225 is an apocalyptic number.
10511223225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10511223225 is a deficient number, since it is larger than the sum of its proper divisors (7781995815).
10511223225 is a wasteful number, since it uses less digits than its factorization.
10511223225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7376329 (or 7376324 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 10511223225 its reverse (52232211501), we get a palindrome (62743434726).
The spelling of 10511223225 in words is "ten billion, five hundred eleven million, two hundred twenty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •