Base | Representation |
---|---|
bin | 11011100101010110011101… |
… | …111001101010000111000001 |
3 | 120220112111122021101011102220 |
4 | 123211112131321222013001 |
5 | 111400102033101204441 |
6 | 1110002514334001253 |
7 | 34360435010334525 |
oct | 3345263571520701 |
9 | 526474567334386 |
10 | 121314000413121 |
11 | 35721a84646a5a |
12 | 11733571346229 |
13 | 528cb26c49019 |
14 | 21d58b3b9bd85 |
15 | e059c7741466 |
hex | 6e559de6a1c1 |
121314000413121 has 8 divisors (see below), whose sum is σ = 161753308333344. Its totient is φ = 80875346384160.
The previous prime is 121314000413087. The next prime is 121314000413141.
121314000413121 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121314000413121 - 227 = 121313866195393 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121314000413091 and 121314000413100.
It is not an unprimeable number, because it can be changed into a prime (121314000413141) 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, 163039756 + ... + 163782141.
It is an arithmetic number, because the mean of its divisors is an integer number (20219163541668).
Almost surely, 2121314000413121 is an apocalyptic number.
It is an amenable number.
121314000413121 is a deficient number, since it is larger than the sum of its proper divisors (40439307920223).
121314000413121 is a wasteful number, since it uses less digits than its factorization.
121314000413121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326945631.
The product of its (nonzero) digits is 576, while the sum is 24.
It can be divided in two parts, 121314000 and 413121, that added together give a palindrome (121727121).
The spelling of 121314000413121 in words is "one hundred twenty-one trillion, three hundred fourteen billion, four hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •