Base | Representation |
---|---|
bin | 111000101110101010… |
… | …1100110000011011101 |
3 | 102122110012021112212222 |
4 | 1301131111212003131 |
5 | 3443444201320034 |
6 | 131544325035125 |
7 | 11541636431462 |
oct | 1613525460335 |
9 | 378405245788 |
10 | 121825026269 |
11 | 477360623a1 |
12 | 1b73ab55aa5 |
13 | b64632a57b |
14 | 5c79895669 |
15 | 328030412e |
hex | 1c5d5660dd |
121825026269 has 4 divisors (see below), whose sum is σ = 121934878620. Its totient is φ = 121715173920.
The previous prime is 121825026247. The next prime is 121825026277. The reversal of 121825026269 is 962620528121.
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 41814115225 + 80010911044 = 204485^2 + 282862^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121825026269 is a prime.
It is a super-2 number, since 2×1218250262692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121825026569) 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, 54924512 + ... + 54926729.
It is an arithmetic number, because the mean of its divisors is an integer number (30483719655).
Almost surely, 2121825026269 is an apocalyptic number.
It is an amenable number.
121825026269 is a deficient number, since it is larger than the sum of its proper divisors (109852351).
121825026269 is a wasteful number, since it uses less digits than its factorization.
121825026269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109852350.
The product of its (nonzero) digits is 207360, while the sum is 44.
The spelling of 121825026269 in words is "one hundred twenty-one billion, eight hundred twenty-five million, twenty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •