Base | Representation |
---|---|
bin | 1110011100000… |
… | …11110010110101 |
3 | 22102220211201201 |
4 | 13032003302311 |
5 | 222002013234 |
6 | 20004052501 |
7 | 3000361141 |
oct | 716036265 |
9 | 272824651 |
10 | 121126069 |
11 | 62410899 |
12 | 34694131 |
13 | 1c12c63c |
14 | 12130221 |
15 | a979314 |
hex | 7383cb5 |
121126069 has 4 divisors (see below), whose sum is σ = 125302860. Its totient is φ = 116949280.
The previous prime is 121126001. The next prime is 121126091. The reversal of 121126069 is 960621121.
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 26316900 + 94809169 = 5130^2 + 9737^2 .
It is a cyclic number.
It is not a de Polignac number, because 121126069 - 27 = 121125941 is a prime.
It is a super-2 number, since 2×1211260692 = 29343049182785522, 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 (121126099) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2088352 + ... + 2088409.
It is an arithmetic number, because the mean of its divisors is an integer number (31325715).
Almost surely, 2121126069 is an apocalyptic number.
It is an amenable number.
121126069 is a deficient number, since it is larger than the sum of its proper divisors (4176791).
121126069 is an equidigital number, since it uses as much as digits as its factorization.
121126069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4176790.
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 121126069 is about 11005.7289172503. The cubic root of 121126069 is about 494.7804610925.
It can be divided in two parts, 12112 and 6069, that added together give a palindrome (18181).
The spelling of 121126069 in words is "one hundred twenty-one million, one hundred twenty-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •