Base | Representation |
---|---|
bin | 101101010010011110010… |
… | …011000100000111000000 |
3 | 102000112011102011120222120 |
4 | 231102132103010013000 |
5 | 401442302300320000 |
6 | 10341421442404240 |
7 | 440564342353014 |
oct | 55223623040700 |
9 | 12015142146876 |
10 | 3112212120000 |
11 | a9a977674335 |
12 | 423201660680 |
13 | 197632412c49 |
14 | aa8bbbd0544 |
15 | 55e50b4e6a0 |
hex | 2d49e4c41c0 |
3112212120000 has 140 divisors (see below), whose sum is σ = 10289699848296. Its totient is φ = 829923200000.
The previous prime is 3112212119999. The next prime is 3112212120011. The reversal of 3112212120000 is 212122113.
It is a super-3 number, since 3×31122121200003 (a number of 38 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
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 19 ways as a sum of consecutive naturals, for example, 12847551 + ... + 13087550.
Almost surely, 23112212120000 is an apocalyptic number.
3112212120000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3112212120000 is an abundant number, since it is smaller than the sum of its proper divisors (7177487728296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3112212120000 is an equidigital number, since it uses as much as digits as its factorization.
3112212120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25935136 (or 25935111 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 3112212120000 its reverse (212122113), we get a palindrome (3112424242113).
The spelling of 3112212120000 in words is "three trillion, one hundred twelve billion, two hundred twelve million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •