Base | Representation |
---|---|
bin | 1110100000110… |
… | …10101001000101 |
3 | 22111002020021212 |
4 | 13100122221011 |
5 | 222131301231 |
6 | 20025221205 |
7 | 3005543414 |
oct | 720325105 |
9 | 274066255 |
10 | 121743941 |
11 | 627a3030 |
12 | 34931805 |
13 | 1c2b7947 |
14 | 1225147b |
15 | aa4c42b |
hex | 741aa45 |
121743941 has 8 divisors (see below), whose sum is σ = 133087968. Its totient is φ = 110446000.
The previous prime is 121743917. The next prime is 121743961. The reversal of 121743941 is 149347121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121743941 - 210 = 121742917 is a prime.
It is a super-2 number, since 2×1217439412 = 29643174340422962, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121743898 and 121743907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121743911) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5870 + ... + 16671.
It is an arithmetic number, because the mean of its divisors is an integer number (16635996).
Almost surely, 2121743941 is an apocalyptic number.
121743941 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121743941 is a deficient number, since it is larger than the sum of its proper divisors (11344027).
121743941 is a wasteful number, since it uses less digits than its factorization.
121743941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23043.
The product of its digits is 6048, while the sum is 32.
The square root of 121743941 is about 11033.7636824431. The cubic root of 121743941 is about 495.6203371171.
The spelling of 121743941 in words is "one hundred twenty-one million, seven hundred forty-three thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •