Base | Representation |
---|---|
bin | 10001101010101110001… |
… | …111010000110100101001 |
3 | 11022001210222220021002211 |
4 | 101222232033100310221 |
5 | 124342441111422441 |
6 | 2325430210325121 |
7 | 153500425562515 |
oct | 21525617206451 |
9 | 4261728807084 |
10 | 1214104014121 |
11 | 428998078709 |
12 | 177374b897a1 |
13 | 8a6496144ab |
14 | 42a97759145 |
15 | 218ad017a81 |
hex | 11aae3d0d29 |
1214104014121 has 4 divisors (see below), whose sum is σ = 1215410908500. Its totient is φ = 1212797119744.
The previous prime is 1214104014119. The next prime is 1214104014163.
1214104014121 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 565821388521 + 648282625600 = 752211^2 + 805160^2 .
It is a cyclic number.
It is not a de Polignac number, because 1214104014121 - 21 = 1214104014119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1214104014092 and 1214104014101.
It is not an unprimeable number, because it can be changed into a prime (1214104014191) 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, 653445796 + ... + 653447653.
It is an arithmetic number, because the mean of its divisors is an integer number (303852727125).
Almost surely, 21214104014121 is an apocalyptic number.
It is an amenable number.
1214104014121 is a deficient number, since it is larger than the sum of its proper divisors (1306894379).
1214104014121 is an equidigital number, since it uses as much as digits as its factorization.
1214104014121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1306894378.
The product of its (nonzero) digits is 256, while the sum is 22.
The spelling of 1214104014121 in words is "one trillion, two hundred fourteen billion, one hundred four million, fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •