Base | Representation |
---|---|
bin | 111000011111000001… |
… | …1001010101111101001 |
3 | 102121002121112122022212 |
4 | 1300332003022233221 |
5 | 3441410311231441 |
6 | 131420254054505 |
7 | 11522633566412 |
oct | 1607603125751 |
9 | 377077478285 |
10 | 121300102121 |
11 | 47496822090 |
12 | 1b6131aa435 |
13 | b591659973 |
14 | 5c29c92809 |
15 | 324e1b5eeb |
hex | 1c3e0cabe9 |
121300102121 has 8 divisors (see below), whose sum is σ = 132335532000. Its totient is φ = 110266030240.
The previous prime is 121300102097. The next prime is 121300102129. The reversal of 121300102121 is 121201003121.
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-121300102121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121300102096 and 121300102105.
It is not an unprimeable number, because it can be changed into a prime (121300102129) 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, 148031 + ... + 514308.
It is an arithmetic number, because the mean of its divisors is an integer number (16541941500).
Almost surely, 2121300102121 is an apocalyptic number.
121300102121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121300102121 is a deficient number, since it is larger than the sum of its proper divisors (11035429879).
121300102121 is a wasteful number, since it uses less digits than its factorization.
121300102121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 678999.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 121300102121 its reverse (121201003121), we get a palindrome (242501105242).
The spelling of 121300102121 in words is "one hundred twenty-one billion, three hundred million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •