Base | Representation |
---|---|
bin | 11011101010000100111001… |
… | …110011101110010010011101 |
3 | 120221200112211211122211212111 |
4 | 123222010321303232102131 |
5 | 111420412114043302034 |
6 | 1110412022021234021 |
7 | 34423052223655441 |
oct | 3352047163562235 |
9 | 527615754584774 |
10 | 121638738650269 |
11 | 35837776941a45 |
12 | 1178649b562911 |
13 | 52b4639cb0679 |
14 | 22074bc5c8821 |
15 | e0e181b18364 |
hex | 6ea139cee49d |
121638738650269 has 2 divisors, whose sum is σ = 121638738650270. Its totient is φ = 121638738650268.
The previous prime is 121638738650257. The next prime is 121638738650279. The reversal of 121638738650269 is 962056837836121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95720590016100 + 25918148634169 = 9783690^2 + 5090987^2 .
It is a cyclic number.
It is not a de Polignac number, because 121638738650269 - 211 = 121638738648221 is a prime.
It is a super-2 number, since 2×1216387386502692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121638738650239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60819369325134 + 60819369325135.
It is an arithmetic number, because the mean of its divisors is an integer number (60819369325135).
Almost surely, 2121638738650269 is an apocalyptic number.
It is an amenable number.
121638738650269 is a deficient number, since it is larger than the sum of its proper divisors (1).
121638738650269 is an equidigital number, since it uses as much as digits as its factorization.
121638738650269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 156764160, while the sum is 67.
The spelling of 121638738650269 in words is "one hundred twenty-one trillion, six hundred thirty-eight billion, seven hundred thirty-eight million, six hundred fifty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •