Base | Representation |
---|---|
bin | 11011010011110110010001… |
… | …011110000010001000100110 |
3 | 120202021112000010002020100220 |
4 | 123103312101132002020212 |
5 | 111220400214424031042 |
6 | 1103242153552145210 |
7 | 34204514350125216 |
oct | 3323662136021046 |
9 | 522245003066326 |
10 | 120111201002022 |
11 | 352a896874497a |
12 | 1157a432238206 |
13 | 520358c6ac159 |
14 | 21935ad964246 |
15 | dd457bdd58ec |
hex | 6d3d91782226 |
120111201002022 has 64 divisors (see below), whose sum is σ = 242368197629184. Its totient is φ = 39680252277120.
The previous prime is 120111201002021. The next prime is 120111201002087. The reversal of 120111201002022 is 220200102111021.
It is a super-2 number, since 2×1201112010020222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120111201001992 and 120111201002010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120111201002021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2227678608 + ... + 2227732524.
It is an arithmetic number, because the mean of its divisors is an integer number (3787003087956).
Almost surely, 2120111201002022 is an apocalyptic number.
120111201002022 is an abundant number, since it is smaller than the sum of its proper divisors (122256996627162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120111201002022 is a wasteful number, since it uses less digits than its factorization.
120111201002022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57653.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120111201002022 its reverse (220200102111021), we get a palindrome (340311303113043).
The spelling of 120111201002022 in words is "one hundred twenty trillion, one hundred eleven billion, two hundred one million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •