Base | Representation |
---|---|
bin | 1110011110101… |
… | …00110100111101 |
3 | 22110112201000202 |
4 | 13033110310331 |
5 | 222043123411 |
6 | 20015133245 |
7 | 3003242621 |
oct | 717246475 |
9 | 273481022 |
10 | 121457981 |
11 | 626181a7 |
12 | 34814225 |
13 | 1c217738 |
14 | 121b9181 |
15 | a9e283b |
hex | 73d4d3d |
121457981 has 8 divisors (see below), whose sum is σ = 122220384. Its totient is φ = 120698640.
The previous prime is 121457971. The next prime is 121457989. The reversal of 121457981 is 189754121.
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 121457981 - 210 = 121456957 is a prime.
It is a super-2 number, since 2×1214579812 = 29504082297192722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121457989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 197831 + ... + 198443.
It is an arithmetic number, because the mean of its divisors is an integer number (15277548).
Almost surely, 2121457981 is an apocalyptic number.
It is an amenable number.
121457981 is a deficient number, since it is larger than the sum of its proper divisors (762403).
121457981 is an equidigital number, since it uses as much as digits as its factorization.
121457981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1531.
The product of its digits is 20160, while the sum is 38.
The square root of 121457981 is about 11020.7976571571. The cubic root of 121457981 is about 495.2319845859.
It can be divided in two parts, 1214 and 57981, that added together give a palindrome (59195).
The spelling of 121457981 in words is "one hundred twenty-one million, four hundred fifty-seven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •