Base | Representation |
---|---|
bin | 11011100001000101101011… |
… | …101111110101011000111101 |
3 | 120212111111121121211112101212 |
4 | 123201011223233311120331 |
5 | 111330302203401412312 |
6 | 1105220154255214205 |
7 | 34330325464164416 |
oct | 3341055357653075 |
9 | 525444547745355 |
10 | 121021101200957 |
11 | 35619840683761 |
12 | 116a6849b17365 |
13 | 526b319281629 |
14 | 21c5649b3080d |
15 | ded083659822 |
hex | 6e116bbf563d |
121021101200957 has 2 divisors, whose sum is σ = 121021101200958. Its totient is φ = 121021101200956.
The previous prime is 121021101200947. The next prime is 121021101201071. The reversal of 121021101200957 is 759002101120121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77786649466276 + 43234451734681 = 8819674^2 + 6575291^2 .
It is a cyclic number.
It is not a de Polignac number, because 121021101200957 - 212 = 121021101196861 is a prime.
It is a super-3 number, since 3×1210211012009573 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121021101200947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60510550600478 + 60510550600479.
It is an arithmetic number, because the mean of its divisors is an integer number (60510550600479).
Almost surely, 2121021101200957 is an apocalyptic number.
It is an amenable number.
121021101200957 is a deficient number, since it is larger than the sum of its proper divisors (1).
121021101200957 is an equidigital number, since it uses as much as digits as its factorization.
121021101200957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2520, while the sum is 32.
The spelling of 121021101200957 in words is "one hundred twenty-one trillion, twenty-one billion, one hundred one million, two hundred thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •