Base | Representation |
---|---|
bin | 1110011101000… |
… | …01110000000001 |
3 | 22110011002001011 |
4 | 13032201300001 |
5 | 222014430034 |
6 | 20010440521 |
7 | 3001411645 |
oct | 716416001 |
9 | 273132034 |
10 | 121248769 |
11 | 62494aa4 |
12 | 34733141 |
13 | 1c173445 |
14 | 12162c25 |
15 | a9a0864 |
hex | 73a1c01 |
121248769 has 4 divisors (see below), whose sum is σ = 121270996. Its totient is φ = 121226544.
The previous prime is 121248733. The next prime is 121248817. The reversal of 121248769 is 967842121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 97121025 + 24127744 = 9855^2 + 4912^2 .
It is a cyclic number.
It is not a de Polignac number, because 121248769 - 211 = 121246721 is a prime.
It is a super-2 number, since 2×1212487692 = 29402527968030722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121248269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3307 + ... + 15919.
It is an arithmetic number, because the mean of its divisors is an integer number (30317749).
Almost surely, 2121248769 is an apocalyptic number.
It is an amenable number.
121248769 is a deficient number, since it is larger than the sum of its proper divisors (22227).
121248769 is an equidigital number, since it uses as much as digits as its factorization.
121248769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22226.
The product of its digits is 48384, while the sum is 40.
The square root of 121248769 is about 11011.3018758002. The cubic root of 121248769 is about 494.9474746157.
The spelling of 121248769 in words is "one hundred twenty-one million, two hundred forty-eight thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •