Base | Representation |
---|---|
bin | 10111001111011000010111… |
… | …010000111010111101111100 |
3 | 111101220101002120000001121201 |
4 | 113033120113100322331330 |
5 | 101344120210114201022 |
6 | 1001215315451305244 |
7 | 30346401122121220 |
oct | 2717302720727574 |
9 | 441811076001551 |
10 | 102212022022012 |
11 | 2a627969851241 |
12 | b56945b44b224 |
13 | 45057245a1876 |
14 | 1b35134294780 |
15 | bc3b81392127 |
hex | 5cf61743af7c |
102212022022012 has 96 divisors (see below), whose sum is σ = 213033867540480. Its totient is φ = 41995702506240.
The previous prime is 102212022022003. The next prime is 102212022022027. The reversal of 102212022022012 is 210220220212201.
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, 122348673 + ... + 123181255.
It is an arithmetic number, because the mean of its divisors is an integer number (2219102786880).
Almost surely, 2102212022022012 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 102212022022012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106516933770240).
102212022022012 is an abundant number, since it is smaller than the sum of its proper divisors (110821845518468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212022022012 is a wasteful number, since it uses less digits than its factorization.
102212022022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 834371 (or 834369 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 102212022022012 its reverse (210220220212201), we get a palindrome (312432242234213).
The spelling of 102212022022012 in words is "one hundred two trillion, two hundred twelve billion, twenty-two million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.318 sec. • engine limits •