Base | Representation |
---|---|
bin | 11011010011110110001100… |
… | …001010111001100010110110 |
3 | 120202021111202220210112202020 |
4 | 123103312030022321202312 |
5 | 111220400024144200042 |
6 | 1103242141054454010 |
7 | 34204512220354551 |
oct | 3323661412714266 |
9 | 522244686715666 |
10 | 120111112100022 |
11 | 352a892254354a |
12 | 1157a408504306 |
13 | 5203577152c14 |
14 | 21935a1c21698 |
15 | dd45741c43ec |
hex | 6d3d8c2b98b6 |
120111112100022 has 8 divisors (see below), whose sum is σ = 240222224200056. Its totient is φ = 40037037366672.
The previous prime is 120111112100011. The next prime is 120111112100039. The reversal of 120111112100022 is 220001211111021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
120111112100022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 120111112099974 and 120111112100010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10009259341663 + ... + 10009259341674.
It is an arithmetic number, because the mean of its divisors is an integer number (30027778025007).
Almost surely, 2120111112100022 is an apocalyptic number.
120111112100022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120111112100022 is a wasteful number, since it uses less digits than its factorization.
120111112100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20018518683342.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 120111112100022 its reverse (220001211111021), we get a palindrome (340112323211043).
The spelling of 120111112100022 in words is "one hundred twenty trillion, one hundred eleven billion, one hundred twelve million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •