Base | Representation |
---|---|
bin | 1100011110000001100… |
… | …0111010100010011000 |
3 | 202110221020000012022002 |
4 | 3013200120322202120 |
5 | 12002204303300422 |
6 | 242224351420132 |
7 | 21322344112160 |
oct | 3074030724230 |
9 | 673836005262 |
10 | 214218025112 |
11 | 82938543983 |
12 | 35625224648 |
13 | 1727bb568a0 |
14 | a52250d5a0 |
15 | 588b7c2692 |
hex | 31e063a898 |
214218025112 has 128 divisors (see below), whose sum is σ = 497683200000. Its totient is φ = 84175635456.
The previous prime is 214218025097. The next prime is 214218025199. The reversal of 214218025112 is 211520812412.
It is a super-2 number, since 2×2142180251122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 133136564 + ... + 133138172.
It is an arithmetic number, because the mean of its divisors is an integer number (3888150000).
Almost surely, 2214218025112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 214218025112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (248841600000).
214218025112 is an abundant number, since it is smaller than the sum of its proper divisors (283465174888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214218025112 is a wasteful number, since it uses less digits than its factorization.
214218025112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2753 (or 2749 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 29.
Adding to 214218025112 its reverse (211520812412), we get a palindrome (425738837524).
The spelling of 214218025112 in words is "two hundred fourteen billion, two hundred eighteen million, twenty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •