Base | Representation |
---|---|
bin | 11011101000111001001101… |
… | …101101111110010100100011 |
3 | 120221101210001222011201221102 |
4 | 123220321031231332110203 |
5 | 111413044143341340041 |
6 | 1110310421403545015 |
7 | 34414144245320345 |
oct | 3350711555762443 |
9 | 527353058151842 |
10 | 121557468308771 |
11 | 35806261955560 |
12 | 1177279a22b16b |
13 | 52a9a879262c1 |
14 | 22035acc4d295 |
15 | e0bec6d6709b |
hex | 6e8e4db7e523 |
121557468308771 has 16 divisors (see below), whose sum is σ = 135258313175808. Its totient is φ = 108311120503200.
The previous prime is 121557468308747. The next prime is 121557468308867. The reversal of 121557468308771 is 177803864755121.
It is a cyclic number.
It is not a de Polignac number, because 121557468308771 - 246 = 51188724131107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121557468308698 and 121557468308707.
It is not an unprimeable number, because it can be changed into a prime (121557468308701) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 319878431 + ... + 320258216.
It is an arithmetic number, because the mean of its divisors is an integer number (8453644573488).
Almost surely, 2121557468308771 is an apocalyptic number.
121557468308771 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121557468308771 is a deficient number, since it is larger than the sum of its proper divisors (13700844867037).
121557468308771 is a wasteful number, since it uses less digits than its factorization.
121557468308771 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640137002.
The product of its (nonzero) digits is 79027200, while the sum is 65.
The spelling of 121557468308771 in words is "one hundred twenty-one trillion, five hundred fifty-seven billion, four hundred sixty-eight million, three hundred eight thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •