Base | Representation |
---|---|
bin | 11011100010110111011011… |
… | …111011010011101100000001 |
3 | 120212221011212211221100000212 |
4 | 123202313123323103230001 |
5 | 111334302330014403441 |
6 | 1105352234235523505 |
7 | 34342211322561110 |
oct | 3342673373235401 |
9 | 525834784840025 |
10 | 121143242341121 |
11 | 35666619116100 |
12 | 117064568b9595 |
13 | 52799b2c2c330 |
14 | 21cb515591c77 |
15 | e013315a1eeb |
hex | 6e2ddbed3b01 |
121143242341121 has 48 divisors (see below), whose sum is σ = 164259413472000. Its totient is φ = 86937507550080.
The previous prime is 121143242341111. The next prime is 121143242341151.
121143242341121 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 121143242341121 - 214 = 121143242324737 is a prime.
It is a super-3 number, since 3×1211432423411213 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (121143242341111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7696946 + ... + 17364603.
It is an arithmetic number, because the mean of its divisors is an integer number (3422071114000).
Almost surely, 2121143242341121 is an apocalyptic number.
121143242341121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121143242341121 is a deficient number, since it is larger than the sum of its proper divisors (43116171130879).
121143242341121 is a wasteful number, since it uses less digits than its factorization.
121143242341121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25062030 (or 25062019 counting only the distinct ones).
The product of its digits is 9216, while the sum is 32.
The spelling of 121143242341121 in words is "one hundred twenty-one trillion, one hundred forty-three billion, two hundred forty-two million, three hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •