Base | Representation |
---|---|
bin | 11011010101001001001010… |
… | …001111000100101001000011 |
3 | 120202121000201121210111022111 |
4 | 123111021022033010221003 |
5 | 111223330002223223021 |
6 | 1103351113142120151 |
7 | 34214115004664554 |
oct | 3325111217045103 |
9 | 522530647714274 |
10 | 120200200211011 |
11 | 35332689451958 |
12 | 1159372ba20057 |
13 | 520baa40781ab |
14 | 2197a1398a32b |
15 | dd6a3a4768e1 |
hex | 6d524a3c4a43 |
120200200211011 has 4 divisors (see below), whose sum is σ = 121439377532872. Its totient is φ = 118961022889152.
The previous prime is 120200200210999. The next prime is 120200200211101. The reversal of 120200200211011 is 110112002002021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120200200211011 - 29 = 120200200210499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120200200210982 and 120200200211000.
It is not an unprimeable number, because it can be changed into a prime (120200200218011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 619588660785 + ... + 619588660978.
It is an arithmetic number, because the mean of its divisors is an integer number (30359844383218).
Almost surely, 2120200200211011 is an apocalyptic number.
120200200211011 is a deficient number, since it is larger than the sum of its proper divisors (1239177321861).
120200200211011 is an equidigital number, since it uses as much as digits as its factorization.
120200200211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1239177321860.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120200200211011 its reverse (110112002002021), we get a palindrome (230312202213032).
The spelling of 120200200211011 in words is "one hundred twenty trillion, two hundred billion, two hundred million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •