Base | Representation |
---|---|
bin | 11011010011111110011111… |
… | …001111011110010101110011 |
3 | 120202022100202212100102011011 |
4 | 123103332133033132111303 |
5 | 111221021301113013021 |
6 | 1103250213140531351 |
7 | 34205246060311354 |
oct | 3323763717362563 |
9 | 522270685312134 |
10 | 120120022001011 |
11 | 35301684995a8a |
12 | 115800943b0b57 |
13 | 5204367048196 |
14 | 2193ba92a1d2b |
15 | dd48e6504de1 |
hex | 6d3f9f3de573 |
120120022001011 has 4 divisors (see below), whose sum is σ = 123049778635224. Its totient is φ = 117190265366800.
The previous prime is 120120022001003. The next prime is 120120022001081. The reversal of 120120022001011 is 110100220021021.
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 120120022001011 - 23 = 120120022001003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120120022000982 and 120120022001000.
It is not an unprimeable number, because it can be changed into a prime (120120022001081) 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, 1464878317045 + ... + 1464878317126.
It is an arithmetic number, because the mean of its divisors is an integer number (30762444658806).
Almost surely, 2120120022001011 is an apocalyptic number.
120120022001011 is a deficient number, since it is larger than the sum of its proper divisors (2929756634213).
120120022001011 is an equidigital number, since it uses as much as digits as its factorization.
120120022001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2929756634212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120120022001011 its reverse (110100220021021), we get a palindrome (230220242022032).
The spelling of 120120022001011 in words is "one hundred twenty trillion, one hundred twenty billion, twenty-two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •