Base | Representation |
---|---|
bin | 11011010010100001010110… |
… | …101110010110010011111011 |
3 | 120201221210122122000210200110 |
4 | 123102201112232112103323 |
5 | 111212402000401010021 |
6 | 1103132234142435403 |
7 | 34165106002622241 |
oct | 3322412656262373 |
9 | 521853578023613 |
10 | 120020021110011 |
11 | 35273229001520 |
12 | 11564826292b63 |
13 | 51c7abb2b6029 |
14 | 218d00008c791 |
15 | dd1ee2191476 |
hex | 6d2856b964fb |
120020021110011 has 32 divisors (see below), whose sum is σ = 174972968801280. Its totient is φ = 72573448147200.
The previous prime is 120020021109943. The next prime is 120020021110021. The reversal of 120020021110011 is 110011120020021.
It is not a de Polignac number, because 120020021110011 - 213 = 120020021101819 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120020021110021) 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, 125867071 + ... + 126817031.
It is an arithmetic number, because the mean of its divisors is an integer number (5467905275040).
Almost surely, 2120020021110011 is an apocalyptic number.
120020021110011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120020021110011 is a deficient number, since it is larger than the sum of its proper divisors (54952947691269).
120020021110011 is a wasteful number, since it uses less digits than its factorization.
120020021110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 958707.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120020021110011 its reverse (110011120020021), we get a palindrome (230031141130032).
It can be divided in two parts, 120020021 and 110011, that multiplied together give a palindrome (13203522530231).
The spelling of 120020021110011 in words is "one hundred twenty trillion, twenty billion, twenty-one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •