Base | Representation |
---|---|
bin | 11011100100000010000010… |
… | …010100010011010000001001 |
3 | 120220012211122020001202220212 |
4 | 123210002002110103100021 |
5 | 111342110401342301441 |
6 | 1105453122441530505 |
7 | 34351045311642005 |
oct | 3344020224232011 |
9 | 526184566052825 |
10 | 121223343322121 |
11 | 35697593023757 |
12 | 11719a904a3a35 |
13 | 5284409c5c301 |
14 | 21d13538d5705 |
15 | e0346d86aeeb |
hex | 6e4082513409 |
121223343322121 has 4 divisors (see below), whose sum is σ = 121229624018244. Its totient is φ = 121217062626000.
The previous prime is 121223343322087. The next prime is 121223343322129.
121223343322121 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 102135278440000 + 19088064882121 = 10106200^2 + 4368989^2 .
It is a cyclic number.
It is not a de Polignac number, because 121223343322121 - 214 = 121223343305737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121223343322129) 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, 3140319110 + ... + 3140357711.
It is an arithmetic number, because the mean of its divisors is an integer number (30307406004561).
Almost surely, 2121223343322121 is an apocalyptic number.
It is an amenable number.
121223343322121 is a deficient number, since it is larger than the sum of its proper divisors (6280696123).
121223343322121 is an equidigital number, since it uses as much as digits as its factorization.
121223343322121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6280696122.
The product of its digits is 20736, while the sum is 32.
The spelling of 121223343322121 in words is "one hundred twenty-one trillion, two hundred twenty-three billion, three hundred forty-three million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •