Base | Representation |
---|---|
bin | 10111001111011000010110… |
… | …100111101001010111100110 |
3 | 111101220101001210122100101100 |
4 | 113033120112213221113212 |
5 | 101344120144331431042 |
6 | 1001215314423340530 |
7 | 30346400631135111 |
oct | 2717302647512746 |
9 | 441811053570340 |
10 | 102212011202022 |
11 | 2a627963730aa7 |
12 | b5694578b1746 |
13 | 45057222839c7 |
14 | 1b35132a79578 |
15 | bc3b8045624c |
hex | 5cf6169e95e6 |
102212011202022 has 24 divisors (see below), whose sum is σ = 224493047437464. Its totient is φ = 33603948887904.
The previous prime is 102212011201981. The next prime is 102212011202039. The reversal of 102212011202022 is 220202110212201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 102212011201986 and 102212011202004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38893458048 + ... + 38893460675.
It is an arithmetic number, because the mean of its divisors is an integer number (9353876976561).
Almost surely, 2102212011202022 is an apocalyptic number.
102212011202022 is an abundant number, since it is smaller than the sum of its proper divisors (122281036235442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212011202022 is a wasteful number, since it uses less digits than its factorization.
102212011202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77786918804 (or 77786918801 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 102212011202022 its reverse (220202110212201), we get a palindrome (322414121414223).
The spelling of 102212011202022 in words is "one hundred two trillion, two hundred twelve billion, eleven million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •