Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …0011111100110110011001 |
3 | 1022110001110020101012111012 |
4 | 2101223211103330312121 |
5 | 2303010233434341441 |
6 | 33143013454543305 |
7 | 2052164624365205 |
oct | 221534523746631 |
9 | 38401406335435 |
10 | 10011121012121 |
11 | 320a768905029 |
12 | 1158280207b35 |
13 | 578077172678 |
14 | 2687800ddb05 |
15 | 12562b4379eb |
hex | 91ae54fcd99 |
10011121012121 has 8 divisors (see below), whose sum is σ = 10110725817024. Its totient is φ = 9911525713200.
The previous prime is 10011121012093. The next prime is 10011121012129. The reversal of 10011121012121 is 12121012111001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10011121012121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10011121012096 and 10011121012105.
It is not an unprimeable number, because it can be changed into a prime (10011121012129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 250325 + ... + 4481618.
It is an arithmetic number, because the mean of its divisors is an integer number (1263840727128).
Almost surely, 210011121012121 is an apocalyptic number.
It is an amenable number.
10011121012121 is a deficient number, since it is larger than the sum of its proper divisors (99604804903).
10011121012121 is a wasteful number, since it uses less digits than its factorization.
10011121012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4752991.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10011121012121 its reverse (12121012111001), we get a palindrome (22132133123122).
The spelling of 10011121012121 in words is "ten trillion, eleven billion, one hundred twenty-one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •