Base | Representation |
---|---|
bin | 11011010101011011101101… |
… | …100011111000100110011111 |
3 | 120202122221010212210220102101 |
4 | 123111123231203320212133 |
5 | 111224141301234101421 |
6 | 1103404205533105531 |
7 | 34215421436202640 |
oct | 3325335543704637 |
9 | 522587125726371 |
10 | 120220120222111 |
11 | 35340080808048 |
12 | 1159756b0282a7 |
13 | 5210929cc7800 |
14 | 21989833ad6c7 |
15 | dd7304192191 |
hex | 6d56ed8f899f |
120220120222111 has 24 divisors (see below), whose sum is σ = 148777230111840. Its totient is φ = 95118563569536.
The previous prime is 120220120222109. The next prime is 120220120222183. The reversal of 120220120222111 is 111222021022021.
It is not a de Polignac number, because 120220120222111 - 21 = 120220120222109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120220120228111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 245408805 + ... + 245898193.
It is an arithmetic number, because the mean of its divisors is an integer number (6199051254660).
Almost surely, 2120220120222111 is an apocalyptic number.
120220120222111 is a deficient number, since it is larger than the sum of its proper divisors (28557109889729).
120220120222111 is a wasteful number, since it uses less digits than its factorization.
120220120222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697075 (or 697062 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 120220120222111 its reverse (111222021022021), we get a palindrome (231442141244132).
The spelling of 120220120222111 in words is "one hundred twenty trillion, two hundred twenty billion, one hundred twenty million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •