Base | Representation |
---|---|
bin | 10100111000100101… |
… | …00000100000001100 |
3 | 1001221101102020110220 |
4 | 22130102200200030 |
5 | 140430240011022 |
6 | 5052320431340 |
7 | 544562461656 |
oct | 123422404014 |
9 | 31841366426 |
10 | 11212032012 |
11 | 4833999665 |
12 | 220aa78550 |
13 | 1098b3538c |
14 | 7851056d6 |
15 | 4594c385c |
hex | 29c4a080c |
11212032012 has 48 divisors (see below), whose sum is σ = 28426675200. Its totient is φ = 3426425280.
The previous prime is 11212031977. The next prime is 11212032037. The reversal of 11212032012 is 21023021211.
It is a super-2 number, since 2×112120320122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11212031982 and 11212032000.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 786087 + ... + 800222.
It is an arithmetic number, because the mean of its divisors is an integer number (592222400).
Almost surely, 211212032012 is an apocalyptic number.
11212032012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11212032012 is an abundant number, since it is smaller than the sum of its proper divisors (17214643188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212032012 is a wasteful number, since it uses less digits than its factorization.
11212032012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1586366 (or 1586364 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11212032012 its reverse (21023021211), we get a palindrome (32235053223).
The spelling of 11212032012 in words is "eleven billion, two hundred twelve million, thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •