Base | Representation |
---|---|
bin | 111000011100011001… |
… | …1010000001101101111 |
3 | 102120212110211211111021 |
4 | 1300320303100031233 |
5 | 3441220240403033 |
6 | 131403430435011 |
7 | 11520514242541 |
oct | 1607063201557 |
9 | 376773754437 |
10 | 121212044143 |
11 | 474510478a3 |
12 | 1b5a9802a67 |
13 | b579337958 |
14 | 5c1c2cd691 |
15 | 32465beb2d |
hex | 1c38cd036f |
121212044143 has 4 divisors (see below), whose sum is σ = 121594416840. Its totient is φ = 120829671448.
The previous prime is 121212044113. The next prime is 121212044147. The reversal of 121212044143 is 341440212121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341440212121 = 31 ⋅11014200391.
It is a cyclic number.
It is not a de Polignac number, because 121212044143 - 225 = 121178489711 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 (121212044147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 191185873 + ... + 191186506.
It is an arithmetic number, because the mean of its divisors is an integer number (30398604210).
Almost surely, 2121212044143 is an apocalyptic number.
121212044143 is a deficient number, since it is larger than the sum of its proper divisors (382372697).
121212044143 is an equidigital number, since it uses as much as digits as its factorization.
121212044143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382372696.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 121212044143 its reverse (341440212121), we get a palindrome (462652256264).
The spelling of 121212044143 in words is "one hundred twenty-one billion, two hundred twelve million, forty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •