Base | Representation |
---|---|
bin | 111000101010000001… |
… | …0101000100101011111 |
3 | 102122001022210200201000 |
4 | 1301110002220211133 |
5 | 3443134234422314 |
6 | 131521034121343 |
7 | 11535033645225 |
oct | 1612402504537 |
9 | 378038720630 |
10 | 121669060959 |
11 | 47666016346 |
12 | 1b6b6880253 |
13 | b61cc203c4 |
14 | 5c62c96b15 |
15 | 3271797209 |
hex | 1c540a895f |
121669060959 has 8 divisors (see below), whose sum is σ = 180250460720. Its totient is φ = 81112707288.
The previous prime is 121669060921. The next prime is 121669060967. The reversal of 121669060959 is 959060966121.
121669060959 is a `hidden beast` number, since 1 + 21 + 6 + 6 + 9 + 0 + 609 + 5 + 9 = 666.
It is not a de Polignac number, because 121669060959 - 27 = 121669060831 is a prime.
It is a super-3 number, since 3×1216690609593 (a number of 34 digits) contains 333 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 (121669060559) 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, 2253130732 + ... + 2253130785.
It is an arithmetic number, because the mean of its divisors is an integer number (22531307590).
Almost surely, 2121669060959 is an apocalyptic number.
121669060959 is a deficient number, since it is larger than the sum of its proper divisors (58581399761).
121669060959 is an equidigital number, since it uses as much as digits as its factorization.
121669060959 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4506261526 (or 4506261520 counting only the distinct ones).
The product of its (nonzero) digits is 1574640, while the sum is 54.
The spelling of 121669060959 in words is "one hundred twenty-one billion, six hundred sixty-nine million, sixty thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •