Base | Representation |
---|---|
bin | 11011010010100011001101… |
… | …010001101111100110001111 |
3 | 120201221222210020122222011110 |
4 | 123102203031101233212033 |
5 | 111212420034041200421 |
6 | 1103133203353423103 |
7 | 34165206204020220 |
oct | 3322431521574617 |
9 | 521858706588143 |
10 | 120022010100111 |
11 | 35274059809199 |
12 | 115650a040aa93 |
13 | 51c80473a6c52 |
14 | 218d14c2bd247 |
15 | dd20abacba76 |
hex | 6d28cd46f98f |
120022010100111 has 64 divisors (see below), whose sum is σ = 198771624898560. Its totient is φ = 62862546501120.
The previous prime is 120022010100089. The next prime is 120022010100119. The reversal of 120022010100111 is 111001010220021.
It is not a de Polignac number, because 120022010100111 - 27 = 120022010099983 is a prime.
It is a super-2 number, since 2×1200220101001112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120022010100119) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 24373545 + ... + 28881026.
It is an arithmetic number, because the mean of its divisors is an integer number (3105806639040).
Almost surely, 2120022010100111 is an apocalyptic number.
120022010100111 is a deficient number, since it is larger than the sum of its proper divisors (78749614798449).
120022010100111 is a wasteful number, since it uses less digits than its factorization.
120022010100111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53254764.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120022010100111 its reverse (111001010220021), we get a palindrome (231023020320132).
The spelling of 120022010100111 in words is "one hundred twenty trillion, twenty-two billion, ten million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •