Base | Representation |
---|---|
bin | 10111001111011000100011… |
… | …001100001111100000100100 |
3 | 111101220101121111112012020010 |
4 | 113033120203030033200210 |
5 | 101344121112330401040 |
6 | 1001215351400210220 |
7 | 30346406102003163 |
oct | 2717304314174044 |
9 | 441811544465203 |
10 | 102212222122020 |
11 | 2a627a617a234a |
12 | b5694b6469970 |
13 | 4505756b9253a |
14 | 1b35152aa13da |
15 | bc3b93c1ae80 |
hex | 5cf62330f824 |
102212222122020 has 48 divisors (see below), whose sum is σ = 290465777504448. Its totient is φ = 26849777750400.
The previous prime is 102212222122001. The next prime is 102212222122037. The reversal of 102212222122020 is 20221222212201.
It is a super-2 number, since 2×1022122221220202 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12712958931 + ... + 12712966970.
It is an arithmetic number, because the mean of its divisors is an integer number (6051370364676).
Almost surely, 2102212222122020 is an apocalyptic number.
102212222122020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102212222122020 is an abundant number, since it is smaller than the sum of its proper divisors (188253555382428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212222122020 is a wasteful number, since it uses less digits than its factorization.
102212222122020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25425925980 (or 25425925978 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 102212222122020 its reverse (20221222212201), we get a palindrome (122433444334221).
The spelling of 102212222122020 in words is "one hundred two trillion, two hundred twelve billion, two hundred twenty-two million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •