Base | Representation |
---|---|
bin | 10100111010001001… |
… | …11011111010111000 |
3 | 1001222022021212020000 |
4 | 22131010323322320 |
5 | 140442131022022 |
6 | 5053512033000 |
7 | 545113030536 |
oct | 123504737270 |
9 | 31868255200 |
10 | 11225251512 |
11 | 48403a8672 |
12 | 2213392760 |
13 | 109b7b3477 |
14 | 786b87156 |
15 | 45a7356ac |
hex | 29d13beb8 |
11225251512 has 80 divisors (see below), whose sum is σ = 32290926360. Its totient is φ = 3640614336.
The previous prime is 11225251481. The next prime is 11225251519. The reversal of 11225251512 is 21515252211.
11225251512 is a `hidden beast` number, since 1 + 122 + 5 + 25 + 1 + 512 = 666.
It is a super-2 number, since 2×112252515122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11225251519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 210118 + ... + 258069.
Almost surely, 211225251512 is an apocalyptic number.
11225251512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11225251512 is an abundant number, since it is smaller than the sum of its proper divisors (21065674848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11225251512 is a wasteful number, since it uses less digits than its factorization.
11225251512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468242 (or 468229 counting only the distinct ones).
The product of its digits is 2000, while the sum is 27.
The spelling of 11225251512 in words is "eleven billion, two hundred twenty-five million, two hundred fifty-one thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •