Base | Representation |
---|---|
bin | 1100010010110100101… |
… | …0000100011110101100 |
3 | 202012011122210002210112 |
4 | 3010231022010132230 |
5 | 11430030004341022 |
6 | 241010132555152 |
7 | 21155001660140 |
oct | 3045512043654 |
9 | 665148702715 |
10 | 211211012012 |
11 | 81635123490 |
12 | 34b26182ab8 |
13 | 16bbcb881b0 |
14 | a318ddd220 |
15 | 57627e58e2 |
hex | 312d2847ac |
211211012012 has 96 divisors (see below), whose sum is σ = 512281104384. Its totient is φ = 73509638400.
The previous prime is 211211011997. The next prime is 211211012021. The reversal of 211211012012 is 210210112112.
It is a super-2 number, since 2×2112110120122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 726683 + ... + 974930.
It is an arithmetic number, because the mean of its divisors is an integer number (5336261504).
Almost surely, 2211211012012 is an apocalyptic number.
211211012012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
211211012012 is an abundant number, since it is smaller than the sum of its proper divisors (301070092372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211211012012 is a wasteful number, since it uses less digits than its factorization.
211211012012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1701679 (or 1701677 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211211012012 its reverse (210210112112), we get a palindrome (421421124124).
The spelling of 211211012012 in words is "two hundred eleven billion, two hundred eleven million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •