Base | Representation |
---|---|
bin | 110000001110100111110110… |
… | …110010000001001011010000 |
3 | 1000211000121211021101002222222 |
4 | 300032213312302001023100 |
5 | 210300212013124020422 |
6 | 2031042254430520212 |
7 | 62451343540531352 |
oct | 6016476662011320 |
9 | 1024017737332888 |
10 | 212111100220112 |
11 | 616488a3392985 |
12 | 1b958676366068 |
13 | 9147cb60a5582 |
14 | 3a543369810d2 |
15 | 197c76a983842 |
hex | c0e9f6c812d0 |
212111100220112 has 20 divisors (see below), whose sum is σ = 432595007028480. Its totient is φ = 100473679051488.
The previous prime is 212111100220079. The next prime is 212111100220133. The reversal of 212111100220112 is 211022001111212.
It is a super-3 number, since 3×2121111002201123 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 348866940848 + ... + 348866941455.
It is an arithmetic number, because the mean of its divisors is an integer number (21629750351424).
Almost surely, 2212111100220112 is an apocalyptic number.
It is an amenable number.
212111100220112 is an abundant number, since it is smaller than the sum of its proper divisors (220483906808368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212111100220112 is a wasteful number, since it uses less digits than its factorization.
212111100220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697733882330 (or 697733882324 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 212111100220112 its reverse (211022001111212), we get a palindrome (423133101331324).
The spelling of 212111100220112 in words is "two hundred twelve trillion, one hundred eleven billion, one hundred million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •