Base | Representation |
---|---|
bin | 11011010010011000111101… |
… | …000101011001101110110001 |
3 | 120201220221101000010022011210 |
4 | 123102120331011121232301 |
5 | 111212230012224323441 |
6 | 1103124143122430333 |
7 | 34164336324220653 |
oct | 3322307505315661 |
9 | 521827330108153 |
10 | 120011001011121 |
11 | 3526a41a432740 |
12 | 11562b295023a9 |
13 | 51c6cb16195cc |
14 | 218c7c61246d3 |
15 | dd1b65344616 |
hex | 6d263d159bb1 |
120011001011121 has 64 divisors (see below), whose sum is σ = 185080365711360. Its totient is φ = 68362689546240.
The previous prime is 120011001011021. The next prime is 120011001011129. The reversal of 120011001011121 is 121110100110021.
It is not a de Polignac number, because 120011001011121 - 27 = 120011001010993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120011001011097 and 120011001011106.
It is not an unprimeable number, because it can be changed into a prime (120011001011129) 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, 3498539856 + ... + 3498574158.
It is an arithmetic number, because the mean of its divisors is an integer number (2891880714240).
Almost surely, 2120011001011121 is an apocalyptic number.
120011001011121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120011001011121 is a deficient number, since it is larger than the sum of its proper divisors (65069364700239).
120011001011121 is a wasteful number, since it uses less digits than its factorization.
120011001011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42606.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 120011001011121 its reverse (121110100110021), we get a palindrome (241121101121142).
The spelling of 120011001011121 in words is "one hundred twenty trillion, eleven billion, one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •