Base | Representation |
---|---|
bin | 111000011001011110… |
… | …1101101110010011111 |
3 | 102120121122120221111221 |
4 | 1300302331231302133 |
5 | 3441020203422143 |
6 | 131350011554211 |
7 | 11515215030436 |
oct | 1606275556237 |
9 | 376548527457 |
10 | 121114123423 |
11 | 47400846587 |
12 | 1b580a5b967 |
13 | b561c716b7 |
14 | 5c0d2c011d |
15 | 323cbcb2ed |
hex | 1c32f6dc9f |
121114123423 has 4 divisors (see below), whose sum is σ = 122225262280. Its totient is φ = 120002984568.
The previous prime is 121114123391. The next prime is 121114123441. The reversal of 121114123423 is 324321411121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 324321411121 = 1823 ⋅177905327.
It is a cyclic number.
It is not a de Polignac number, because 121114123423 - 25 = 121114123391 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121114123463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 555569265 + ... + 555569482.
It is an arithmetic number, because the mean of its divisors is an integer number (30556315570).
Almost surely, 2121114123423 is an apocalyptic number.
121114123423 is a deficient number, since it is larger than the sum of its proper divisors (1111138857).
121114123423 is a wasteful number, since it uses less digits than its factorization.
121114123423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111138856.
The product of its digits is 1152, while the sum is 25.
Adding to 121114123423 its reverse (324321411121), we get a palindrome (445435534544).
The spelling of 121114123423 in words is "one hundred twenty-one billion, one hundred fourteen million, one hundred twenty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •