Base | Representation |
---|---|
bin | 11011010010011010000100… |
… | …101010111000110100001111 |
3 | 120201221001110201000212210020 |
4 | 123102122010222320310033 |
5 | 111212234442204120421 |
6 | 1103124502224313223 |
7 | 34164411146510622 |
oct | 3322320452706417 |
9 | 521831421025706 |
10 | 120012202020111 |
11 | 3526a986368555 |
12 | 11563203772813 |
13 | 51c71433a510b |
14 | 218c89b837db9 |
15 | dd1bd59cddc6 |
hex | 6d2684ab8d0f |
120012202020111 has 8 divisors (see below), whose sum is σ = 168438178273920. Its totient is φ = 75797180223192.
The previous prime is 120012202020071. The next prime is 120012202020157. The reversal of 120012202020111 is 111020202210021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120012202020111 - 218 = 120012201757967 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120012202020311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1052738614155 + ... + 1052738614268.
It is an arithmetic number, because the mean of its divisors is an integer number (21054772284240).
Almost surely, 2120012202020111 is an apocalyptic number.
120012202020111 is a deficient number, since it is larger than the sum of its proper divisors (48425976253809).
120012202020111 is a wasteful number, since it uses less digits than its factorization.
120012202020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2105477228445.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120012202020111 its reverse (111020202210021), we get a palindrome (231032404230132).
The spelling of 120012202020111 in words is "one hundred twenty trillion, twelve billion, two hundred two million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •